Train Problem I
来源:互联网 发布:淘宝直播加入要钱吗 编辑:程序博客网 时间:2024/05/16 11:51
Train Problem I
1000ms
1000ms
32768KB
64-bit integer IO format: %I64d Java class name: Main
Font Size:
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#include<iostream>#include<algorithm>#include<functional>#include<cmath>#include<cstring>#include<cstdio>#include<cstdlib>#include<queue>#include<stack>#define MAX(x,y) x>y?x:y;#define MIN(x,y) x<y?x:y;using namespace std;int main(){ int n; stack<int>s; char str1[10],str2[10]; int mark[20]; int i,j,k; while(cin>>n>>str1>>str2) { i=0; j=0; k=1; s.push(str1[0]); mark[0]=1; while(i<n&&j<n) { if(!s.empty()&&s.top()==str2[j]) { j++; s.pop(); mark[k++]=0; } else { if(i==n) { break; } s.push(str1[++i]); mark[k++]=1; } } if(i!=n) { cout<<"Yes."<<endl; for(i=0;i<2*n;i++) { if(mark[i]==1) { cout<<"in"<<endl; } else { cout<<"out"<<endl; } } } else { cout<<"No."<<endl; } cout<<"FINISH"<<endl; } return 0;}
- 1022 Train Problem I
- HDU1022 Train Problem I
- Train Problem I
- 1022:Train Problem I
- 1022 Train Problem I
- HDU1022 Train Problem I
- Train Problem I
- HDU1022:Train Problem I
- HDU1022--Train Problem I
- Train Problem I
- hdu1022-Train Problem I
- HDU1022 Train Problem I
- hdu1022 Train Problem I
- Train Problem I
- Train Problem I
- Train Problem I
- D. Train Problem I
- Train Problem I
- linux下配置MemAdmin
- ORACLE 用户表权限授权
- 我拒绝接受的几个最佳编程实践方法
- - viewDidLoad 和 - viewWillApear 和 -viewDidAppear
- TCP不会造成IP分片,而UDP和ICMP则会造成IP分片
- Train Problem I
- C++第三课
- CRM上线之路 走上了CRM实施顾问-第13天上班 -第四周
- Ural 1260. Nudnik Photographer DP
- 穷人变态理财宝典
- Java Socket网络编程常见异常
- SQL Server 2008数据库被标记为可疑的解决方法
- 新手必备 零基础打造 全屏海报!让你的店铺更加专业
- hadoop主节点(NameNode)备份策略以及恢复方法