HDOJ 1022 Train Problem I(栈)
2015-07-30 19:13
691 查看
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26100 Accepted Submission(s): 9852
[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.
![](http://acm.hdu.edu.cn/data/images/1022-1.jpg)
![](http://acm.hdu.edu.cn/data/images/1022-2.jpg)
![](http://acm.hdu.edu.cn/data/images/1022-3.jpg)
[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 HintHint 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.".
[align=left]Author[/align]
Ignatius.L
[align=left]Recommend[/align]
We have carefully selected several similar problems for you: 1026 1023 1032 1010 1016
简单的栈问题
#include<cstdio> #include<stack> #include<cstring> using namespace std; int main(){ int n,j,i,k,flag[50]; char in[15],out[15];//入栈顺序和出栈顺序 while(~scanf("%d %s %s",&n,in,out)){ stack <char> sta; memset(flag,-1,sizeof(flag));//为1表示压入栈,为0表示输出栈,记录进出栈过程 j=k=0; for(i=0;i<n;i++){//输入的位置的变化 sta.push(in[i]);//入栈 flag[k++]=1; while(!sta.empty()&&sta.top()==out[j]){//当栈不空并且栈顶元素与当前要出栈元素相等时出栈,否者入栈 flag[k++]=0;//为0表示输出栈 j++; sta.pop(); } } if(j==n){ printf("Yes.\n"); for(i=0;i<k;i++){ if(flag[i]) printf("in\n");//为1表示压入栈,为0表示输出栈 else printf("out\n"); } } else printf("No.\n"); printf("FINISH\n"); } return 0; }
相关文章推荐
- Aircrack-ng支持网卡列表(上)
- 出现 duplicate symbols for architecture arm**,linker command failed with exit code 1错误解决办法
- hdu 5335 Walk Out (2015 Multi-University Training Contest 4)
- 一个类的字段存取器,分别在什么场合需要用 assign、copy、retain呢?
- STM32F1XX devices vector table for EWARM toolchain.
- apt-get update时卡在 waiting for headers
- HDU 5336 XYZ and Drops 2015 Multi-University Training Contest 4 1010
- 解决Failed to connect session for conifg 故障
- 2015 Multi-University Training Contest 4 (hdu 5335、5336)模拟
- Failed to initialize monitor thread:unable to establish loopback connection
- leetcode 070 —— Climbing Stairs
- HDU 5319 Painter
- 2015 Multi-University Training Contest 4
- HDOJ 3420 Bus Fair(动规)
- clang: error: linker command failed with exit code 1 (use -v to see invocation)
- 解决svn执行cleanup出现failed–previous operation has not finished; run cleanup if it was interrupted 的错误
- 2015 Multi-University Training Contest 4 1001 Olympiad
- Filter及FilterChain的使用详解
- 运行百度地图demo时出现XML file line #6: Error inflating class com.baidu.mapapi.map.MapView的错误
- JUnit中Failure、Error区别