杭电 队列 1022
2014-05-22 23:11
183 查看
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
3 123 321 3 123 312
[align=left]Sample Output[/align]
Yes. in in in out out out FINISH No. FINISH 代码:#include<stdio.h>char stack[10000];int top;void Push(charc) { stack[top++]=c;}void Pop(){ top--;}char Top(){ return stack[top-1];}bool Empty(){ if(top==0) return true; return false;}int main(){ int n=0; while(~scanf("%d",&n)) { top=0; int i=0,j=0,k=0; char in[10000],out[10000],step[10000]; scanf("%s%s",in,out); while(i<n) { Push(in[i++]); step[k++]='i'; while(!Empty()&&Top()==out[j]) { Pop(); j++; step[k++]='o'; } } if(Empty()) { printf("Yes.\n"); for(i=0;i<k;i++) { if(step[i]=='i') printf("in\n"); else printf("out\n"); } } else printf("No.\n"); printf("FINISH\n"); } return 0;}
相关文章推荐
- HDU--杭电--1026--Ignatius and the Princess I--广搜--直接暴力0MS,优先队列的一边站
- 【杭电】[1276]士兵队列训练问题
- 【杭电1387】Team Queue 嵌套队列
- 【杭电1285】拓扑排序-二维数组--链式存储--队列
- 【ACM】杭电1022:Train Problem I
- 杭电1276:士兵队列训练问题
- 杭电5945Fxx and game(单调队列优化dp)
- 杭电1022题-火车进出站
- 杭电 1276 士兵队列训练问题
- 【杭电oj】1702 - ACboy needs your help again!(栈和队列)
- 【ACM】杭电1022:Train Problem I
- ACboy needs your help again!(杭电1702)(栈和队列的基础应用)
- Rescue HDU杭电1242【广搜+优先队列】
- 【杭电oj】1022 - Train Problem I(栈)
- HDU--杭电--3415--Max Sum of Max-K-sub-sequence--队列--双向队列
- 【杭电oj】2066 - 一个人的旅行(迪杰斯塔拉,优先队列优化)
- 杭电1022 Train Problem I
- 【搜索之BFS + 优先队列】杭电 hdu 1026 Ignatius and the Princess I
- 杭电 1873 看病要排队 队列
- 杭电acm1276 士兵队列训练问题