HDU 1022 (栈的问题)
来源:互联网 发布:在淘宝上怎么买药 编辑:程序博客网 时间:2024/04/29 23:13
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3548 Accepted Submission(s): 1299
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思路:每次的数据完后都要清栈,不然会WA。。。我就是因为这个错误一直在WA - -||代码如下:
- HDU 1022 (栈的问题)
- HDU 1022 栈的问题
- HDU 1022 栈的问题
- hdu 1022 火车 栈 问题
- 解决HDU爆栈的问题
- 解决HDU爆栈的问题 .
- 解决HDU爆栈的问题
- 解决HDU爆栈的问题
- 解决HDU爆栈的问题
- 解决HDU爆栈的问题
- HDU-1022 火车进出站问题【栈】
- hdu 1022(栈的应用)
- hdu 圆桌问题(STL(vector)的模拟)
- HDU 1251(搜索题,典型的字典树问题)
- Bone Collector (简单的0-1背包问题) HDU
- hdu 2066 一个人的旅行(最短路问题)
- hdu 3791(动态内存的释放问题)未解决
- [HDU 2068] RPG的错排 (错排问题)
- 2010-04-24
- SQL2008 Merge关键字用法与简例
- XmlReader 读取器读取内存流 MemoryStream 的注意事项
- Silverlight游戏设计(Game Design):(十一)梦幻西游(Demo) 之 “天人合一”②
- 写的一款LRC格式歌词编辑软件 (ManeLrc) 欢迎下载
- HDU 1022 (栈的问题)
- XEN: Linux虚拟机软体
- [Qt Topic] – 全局热键、托盘功能和随机启动
- Kernel-based Virtual Machine (1)
- 写的一款安全期避孕计算软件 (IWOMAN女性生理周期计算) 强力推荐!
- Kernel-based Virtual Machine (2)
- 一个好的学术资源论坛~~~确实很好 ,一起分享~~
- 关于这个blog
- 努力