HDU1022--Train Problem I(栈)
来源:互联网 发布:ubuntu 设置dns 编辑:程序博客网 时间:2024/05/21 09:42
Train Problem
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
#include<stdio.h>#include<string.h>#include<stack> #include<algorithm>using namespace std;bool b[100000];char a[100], c[100];int main(){ stack<int> s; int n; while(~scanf("%d%s%s",&n,a,c)) { while(!s.empty()) s.pop(); int k = 0, j = 0; for(int i = 0;i < n; i++){ s.push(a[i]); b[j] = true; j++; while(!s.empty() && s.top() == c[k]){ k++; b[j] = false; s.pop(); j++; } } if(!s.empty()) printf("No.\n"); else { printf("Yes.\n"); for(int i = 0;i < j; i++) { if(b[i]) printf("in\n"); else printf("out\n"); } } printf("FINISH\n"); memset(a,0,sizeof(a)); memset(c,0,sizeof(c)); }return 0;}
阅读全文
0 0
- HDU1022--Train Problem I(栈)
- HDU1022 Train Problem I
- HDU1022 Train Problem I
- HDU1022:Train Problem I
- HDU1022--Train Problem I
- hdu1022-Train Problem I
- HDU1022 Train Problem I
- hdu1022 Train Problem I
- hdu1022 Train Problem I
- HDU1022 Train Problem I
- HDU1022 Train Problem I
- hdu1022 Train Problem I
- hdu1022-Train Problem I
- hdu1022 - Train Problem I
- hdu1022 Train Problem I
- hdu1022 栈的模拟(Train Problem I)
- hdu1022 Train Problem I 栈的应用
- Train Problem I--hdu1022(栈)
- HDU 1030 (Delta-wave )
- spring boot之集成数据库
- pdf文档相关操作软件简介及其下载
- 深度学习在情感分析中的应用
- Informatica中利用ODBC连接Oracle、Sybase的配置方法
- HDU1022--Train Problem I(栈)
- CentOS7.3 安装Docker
- 跨域单点登录实现
- wm_concat
- js数组对象排序
- Canvas 简介及适配
- wget命令部分参数使用一般方法
- Chrome浏览器的黑屏如何解决
- 三级缓存之AsyncTask学习