hdu 1022 整理下水题 栈和队列
来源:互联网 发布:功夫 知乎 编辑:程序博客网 时间:2024/06/03 00:18
Problem Description
As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). But here comes a problem, there is only one railway where all the trains stop. So all the trains come in from one side and get out from the other side. For this problem, if train A gets into the railway first, and then train B gets into the railway before train A leaves, train A can't leave until train B leaves. The pictures below figure out the problem. Now the problem for you is, there are at most 9 trains in the station, all the trains has an ID(numbered from 1 to n), the trains get into the railway in an order O1, your task is to determine whether the trains can get out in an order O2.
Input
The input contains several test cases. Each test case consists of an integer, the number of trains, and two strings, the order of the trains come in:O1, and the order of the trains leave:O2. The input is terminated by the end of file. More details in the Sample Input.
Output
The output contains a string "No." if you can't exchange O2 to O1, or you should output a line contains "Yes.", and then output your way in exchanging the order(you should output "in" for a train getting into the railway, and "out" for a train getting out of the railway). Print a line contains "FINISH" after each test case. More details in the Sample Output.
Sample Input
3 123 3213 123 312
Sample Output
Yes.inininoutoutoutFINISHNo.FINISHFor the first Sample Input, we let train 1 get in, then train 2 and train 3.So now train 3 is at the top of the railway, so train 3 can leave first, then train 2 and train 1.In the second Sample input, we should let train 3 leave first, so we have to let train 1 get in, then train 2 and train 3.Now we can let train 3 leave.But after that we can't let train 1 leave before train 2, because train 2 is at the top of the railway at the moment.So we output "No.".HintHint
#include<stdio.h>#include<string.h>#include<algorithm>#include<stack>#include<queue>using namespace std;int main(){char a[100],b[100];int n;while(~scanf("%d",&n)){int flag[100];scanf("%s %s",a,b);stack<char> s;int l = strlen(a);int o,z,v; o = z = v = 0;while(1){for(;o<l&&a[o]!=b[z];o++){s.push(a[o]);flag[v++] = 1;}if(o!=l){s.push(a[o]); o++; flag[v++] = 1;} for(;z<l&&(!s.empty())&&s.top() == b[z];z++){ s.pop(); flag[v++] = 0; } if(o==l||z==l)break;}if(z==l){printf("Yes.\n"); for(int i=0;i<v;i++){if(flag[i])printf("in\n");else printf("out\n"); }}else printf("No.\n");printf("FINISH\n");}}
Problem Description
As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). But here comes a problem, there is only one railway where all the trains stop. So all the trains come in from one side and get out from the other side. For this problem, if train A gets into the railway first, and then train B gets into the railway before train A leaves, train A can't leave until train B leaves. The pictures below figure out the problem. Now the problem for you is, there are at most 9 trains in the station, all the trains has an ID(numbered from 1 to n), the trains get into the railway in an order O1, your task is to determine whether the trains can get out in an order O2.
Input
The input contains several test cases. Each test case consists of an integer, the number of trains, and two strings, the order of the trains come in:O1, and the order of the trains leave:O2. The input is terminated by the end of file. More details in the Sample Input.
Output
The output contains a string "No." if you can't exchange O2 to O1, or you should output a line contains "Yes.", and then output your way in exchanging the order(you should output "in" for a train getting into the railway, and "out" for a train getting out of the railway). Print a line contains "FINISH" after each test case. More details in the Sample Output.
Sample Input
3 123 3213 123 312
Sample Output
Yes.inininoutoutoutFINISHNo.FINISHFor the first Sample Input, we let train 1 get in, then train 2 and train 3.So now train 3 is at the top of the railway, so train 3 can leave first, then train 2 and train 1.In the second Sample input, we should let train 3 leave first, so we have to let train 1 get in, then train 2 and train 3.Now we can let train 3 leave.But after that we can't let train 1 leave before train 2, because train 2 is at the top of the railway at the moment.So we output "No.".HintHint
0 0
- hdu 1022 整理下水题 栈和队列
- hdu 1702 整理下水题 栈和队列
- hdu 2037 整理下水题
- hdu 1870 整理下水题
- hdu 1711 整理下水题
- hdu 1009 整理下水题 贪心
- hdu 1789 整理下水题 贪心
- hdu 1106 整理下水题 排序
- hdu 2020 整理下水题 排序
- hdu 1425 整理下水题 排序
- hdu 1785 整理下水题 排序
- hdu 2602 整理下水题 背包
- hdu 2013 整理下水题 递推动规
- hdu 2041 整理下水题 递推动规
- hdu 2569 整理下水题 递推动规
- hdu 2084 整理下水题 递推动规
- hdu 1159 整理下水题 递推动规
- HDU-1076-An Easy Task(Debian下水题测试.....)
- hdu 1999 不可摸数
- 两个对象值相同(x.equals(y) == true),但却可有不同的hash code,这句话对不对?
- 浅析 Linux 初始化 init 系统,第 3 部分: Systemd
- 派生类
- (11)异常
- hdu 1022 整理下水题 栈和队列
- 回忆是一种速效感冒药
- 构造器Constructor是否可被override?
- 忍——屁话
- 第一次使用
- osgi 和 maven jar包的管理
- 浅谈Oracle死锁问题
- 图结构练习——最小生成树-prim
- java作用域public ,private ,protected 及不写时的区别