hdoj 1022 Train Problem I【栈】
2015-09-11 22:03
316 查看
Train Problem I
[b]Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26563 Accepted Submission(s): 10043
[/b]
[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]
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.".
#include<stdio.h> #include<string.h> #include<stack> using namespace std; int main() { int i,j,k,n; char in[10],out[10]; int a[20]; stack<char>s; while(scanf("%d",&n)!=EOF) { getchar(); scanf("%s%s",in,out); memset(a,-1,sizeof(a)); while(!s.empty()) s.pop(); i=j=k=0; while(i<n) { s.push(in[i++]); a[j++]=1; while(!s.empty()&&s.top()==out[k]) { k++; a[j++]=0; s.pop(); } } if(s.empty()) { printf("Yes.\n"); for(i=0;i<j;i++) { if(a[i]) printf("in\n"); else printf("out\n"); } printf("FINISH\n"); } else printf("No.\nFINISH\n"); } return 0; }
相关文章推荐
- 使用dup和dup2重定向和还原 http://blog.csdn.net/kangear/article/details/24098315
- hdu5029Relief grain 线段树
- kvm随笔系列二: Qemu中的AIO小结
- 使用Windows的分析等待链(analyze wait chain)来诊断没用响应的应用
- Chain of Responsibility - 责任链模式
- Websphere8 AIX静默安装卸载升级
- ADB server didn't ACK failed to start daemon *解决方案
- AIX采用LV创ASM磁盘组
- 使用Keychain存储用户敏感信息
- linux下tty,控制台,虚拟终端,串口,console(控制台终端)详解http://blog.csdn.net/liaoxinmeng/article/details/5004743
- extmail安装配置
- 10个关于人工智能和机器学习的有趣开源项目
- IO系统性能之二:缓存和RAID如何提高IO
- aix系统查看WWNN命令
- lodash 中文学习拾零之 Chain篇
- sendEmail
- Linux tail 命令详解 http://www.2cto.com/os/201111/110143.html
- 出错file is universal (3 slices) but does not contain a(n) armv7s slice
- 手机 同步失败,失败原因:failed to copy
- Unix Study之--AIX删除卷组中物理卷