CSU-ACM2017暑期训练1-Debug与STL hdu1022-Train Problem I
来源:互联网 发布:php倒计时钟代码 编辑:程序博客网 时间:2024/06/05 16:37
题目链接:train problem 1
题目:
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 38224 Accepted Submission(s): 14372
Problem DescriptionAs 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.
InputThe 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.
OutputThe 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 Input3 123 3213 123 312
Sample OutputYes.inininoutoutoutFINISHNo.FINISHHintHint 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.".
3 123 3213 123 312
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
题意:给你两串序列,问第二串能不能由第一个串在栈的进出操作中得到(第一个串进栈必须按照自己的顺序,出栈可以随时出)
思路:直接模拟,注意判断条件
代码:
#include<cstdio>#include<cstring>#include<algorithm>#include<string>#include<iostream>#include<stack>using namespace std;string a,b;int c[11];int n,lena,lenb,aa,bb,cc;stack<char>s;int main(){ while(scanf("%d",&n)!=EOF) { cin>>a>>b; while(!s.empty()) s.pop(); lena=a.length(); lenb=b.length(); aa=bb=cc=0; s.push(a[aa++]); c[cc++]=0; while(bb<lenb) { if(!s.empty()&&s.top()==b[bb]) { s.pop(); bb++; c[cc++]=1;//out } else { s.push(a[aa++]); c[cc++]=0;//in } } if(s.empty()) { printf("Yes.\n"); for(int i=0;i<cc;i++) { if(c[i]==1) printf("out\n"); else printf("in\n"); } } else { printf("No.\n"); } printf("FINISH\n"); } return 0;}
阅读全文
0 0
- CSU-ACM2017暑期训练1-Debug与STL hdu1022-Train Problem I
- Train Problem I CSU-ACM2017暑期训练1-Debug与STL
- Languages CSU-ACM2017暑期训练1-Debug与STL
- CSU-ACM2017暑期训练1-Debug与STL hdu2736
- CSU-ACM2017暑期训练1-Debug与STL hdu1896-Stones
- CSU-ACM2017暑期训练1-Debug与STL -圆桌问题
- CSU-ACM2017暑期训练1-Debug与STL B
- CSU-ACM2017暑期训练1-Debug与STL A
- CSU-ACM2017暑期训练1-Debug与STL C
- CSU-ACM2017暑期训练1-Debug与STL E
- Languages--CSU-ACM2017暑期训练1-Debug与STL
- CSU-ACM2017暑期训练1-Debug与STL Jury Marks-set判重
- CSU-ACM2017暑期训练1-Debug与STL C-Languages-map判重
- CSU-ACM2017暑期训练3-递推与递归I
- CSU-ACM2017暑期训练3-递推与递归I
- CSU-ACM2017暑期训练6-bfs I
- HDU1022 Train Problem I
- HDU1022 Train Problem I
- PAT 乙级 1032. 挖掘机技术哪家强(20)
- Eclipse使用:编译指定的文件夹,配置文件的使用
- 深度学习
- 师万物博客的历程(总)
- 关于程序中使用反射时混淆造成的问题
- CSU-ACM2017暑期训练1-Debug与STL hdu1022-Train Problem I
- HDU1338 解题报告
- elastic-job详解(一):数据分片
- CentOS7下搭建solr6.6全文检索服务器及IK分词器配置
- pydbg安装指南(多图,超详细)
- CSSHack
- PAT乙级 1013. 数素数 (20) 素数表
- Linux命令学习之六
- hihoCoder挑战赛12 ABC