hdu——1022——Train Problem I
来源:互联网 发布:python爬虫项目 知乎 编辑:程序博客网 时间:2024/05/23 21:50
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 321
3 123 312
Sample Output
Yes.
in
in
in
out
out
out
FINISH
No.
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 321
3 123 312
Sample Output
Yes.
in
in
in
out
out
out
FINISH
No.
FINISH
如果是4 1234 2134 也是“Yes”,1进栈,2进栈,2,出栈,1出栈,3进栈,3出栈,4进栈,4出栈
#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <stack>using namespace std;int main(){int n;char in[20],out[20],temp;;int i,j,k;int flag[20],flag1;stack<char>s; while(scanf("%d",&n)!=EOF){ while(!s.empty())//每次都清空 s.pop(); cin>>in>>out; j=k=0; flag1=1; for(int i=0;i<n;i++) { if(flag1) { s.push(in[i]); flag[k++]=1; } temp=s.top(); if(temp==out[j]) { s.pop(); j++; flag[k++]=0; if(!s.empty()) { flag1=0;//如果有车出栈,并且栈不是空,则不能让车出栈 i--; } else flag1=1;//如果栈不是空,肯定要出栈 } else flag1=1;//如果没有车出栈,下列车可以出栈 } flag1=0;while(!s.empty()){temp=s.top();if(temp==out[j]){s.pop();j++;flag[k++]=0;}else{flag1=1;break;}}if(flag1)cout<<"No."<<endl;else{cout<<"Yes."<<endl;for(int i=0;i<2*n;i++){if(flag[i]) cout<<"in";else cout<<"out";cout<<endl;}}cout<<"FINISH"<<endl; }return 0;}
0 0
- hdu——1022——Train Problem I
- HDU 1022 Train Problem I (数据结构 —— 栈)
- hdu1022——Train Problem I
- HDU 1022 Train Problem I
- HDU-1022 Train Problem I
- HDU 1022 Train Problem I
- HDU 1022 ( Train Problem I )
- HDU 1022 Train Problem I
- HDU 1022 Train Problem I
- Hdu 1022 - Train Problem I
- HDU-1022:Train Problem I
- hdu 1022 Train Problem I
- hdu 1022 Train Problem I
- hdu-Train Problem I-1022
- hdu 1022 Train Problem I
- hdu 1022 Train Problem I
- hdu 1022 Train Problem I
- HDU 1022 Train Problem I
- iOS 随机数(Fixed)
- Nineteen
- andriod驱动之旅-导出设备配置文件修改之后导入到设备
- Error[Pe127]: expected a statement 错误
- 点击文字可以选中相应的checkbox
- hdu——1022——Train Problem I
- Hadoop中的SequenceFile
- 关于oracle blob类型、clob类型在hibernate 中如何使用注解
- codeforces比赛题A. Nineteen,BThree matrices
- 解决HTML5新标签不兼容的问题
- document.addEventListener 事件的最后一个参数
- 第一篇流水帐
- JavaScript专业八级测试,答案
- iOS学习之iOS沙盒(sandbox)机制和文件操作(二)