Train Problem I
2015-07-27 19:54
363 查看
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25938 Accepted Submission(s): 9801
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 321
3 123 312
Sample Output
Yes.
in
in
in
out
out
out
FINISH
No.
FINISH
Hint
Hint
For 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.".
YES的情况
情况一:3 123 321
情况二:3 123 132
情况三:3 123 123
还有这三种情况的组合;
Total Submission(s): 25938 Accepted Submission(s): 9801
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 321
3 123 312
Sample Output
Yes.
in
in
in
out
out
out
FINISH
No.
FINISH
Hint
Hint
For 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.".
YES的情况
情况一:3 123 321
情况二:3 123 132
情况三:3 123 123
还有这三种情况的组合;
#include<stdio.h> #include<string.h> char a[300000],b[100000],c[300000]; int x[100000]; int main() { int i,j,k,n,m,s; while(scanf("%d%s%s",&n,a,b)!=EOF) { k=1;// strcat(a,b);// j=strlen(a);// for(i=0;i<n;i++) int f[1000]; int l=0; c[k]=a[0]; i=0; j=0; f[0]=1; while(i<n&&j<n) { if(c[k]==b[j]) { k--; f[++l]=0; j++; } else { c[++k]=a[++i]; f[++l]=1; } } if(k==0) { printf("Yes.\n"); for(i=0;i<=l;i++) if(f[i]==1) printf("in\n"); else printf("out\n"); } else printf("No.\n"); printf("FINISH\n"); } return 0; }
相关文章推荐
- PAINT和WM_ERASEBKGND消息
- 为什么delegate属性使用assigne而不是retain?
- 220Contains Duplicate III
- Factorial Trailing Zeroes
- hdu-1022 Train Problem I (栈的简单应用)
- HDU-2057 A+B Again
- 绑定远程服务的流程aidl
- HDU 2925 Musical Chairs(约瑟夫环问题)
- Climbing Stairs
- offsetof与container_of宏(个人理解)
- poj3250 Bad Hair Day
- hpu 1022&&nyoj 150 Train Problem I 【栈】
- Container With Most Water
- hdu杭电1002 Train Problem I【栈】
- 杭电1022 Train Problem I
- idea 14 Error: Failed to create a child event loop
- hdu4770Lights Against Dudely 暴力搜索
- hdoj 1789 Doing Homework again
- hdoj-1022-Train Problem I(栈)
- 《配置Naigos nrpe的客户端(LINUX、Windows)》