HDU-1022-Train Problem I
来源:互联网 发布:数据库软件排行 编辑:程序博客网 时间:2024/06/06 13:07
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 38967 Accepted Submission(s): 14675
Total Submission(s): 38967 Accepted Submission(s): 14675
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
Author
Ignatius.L
#include<cstdio>#include<stack>#include<queue>#include<algorithm>using namespace std;char a[100],b[100],c[100];int main(){int n;while(scanf("%d %s %s",&n,a,b)!=EOF){int i=0,j=0,k=1;stack<char> Q;Q.push(a[i]);//为防止空栈 c[0]=1;//记录为1,1为进,0为出; while(i<n&&j<n){if(Q.size()&&Q.top()==b[j]){//如果栈顶元素和b中当前元素相同就弹出,并把b向后移动1位; j++;Q.pop();c[k++]=0; }else{if(i==n){break;}Q.push(a[++i]);//再次进栈; c[k++]=1;}}if(i==n){printf("No.\n");}else{printf("Yes.\n");for(int l=0;l<k;l++){if(c[l]){printf("in\n");}else{printf("out\n");}}}printf("FINISH\n");}return 0;}
阅读全文
0 0
- 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
- hdu 1022 Train Problem I
- hdu 1022 Train Problem I
- HDU 1022Train Problem I
- python-图灵-聊天机器人
- Jobs added with no trigger must be durable
- commons.lang中常用的工具类
- 逻辑结构和存储结构
- IntelliJ Idea 2017 免费激活方法
- HDU-1022-Train Problem I
- iOS左滑插入多个按钮,按钮自定义颜色、图片、文字字体等
- spring boot devtools 热部署工具
- Android 屏幕适配:最全面的解决方案
- Speed/accuracy trade-offs for modern convolutional object detectors
- 文本编辑工具VIM
- 四种常见排序算法C++实现
- redis:学习路程
- 学生信息管理系统之ASCII问题汇总