hdu-1022 Train Problem I (栈的简单应用)
来源:互联网 发布:xp系统32位java下载 编辑:程序博客网 时间:2024/05/22 02:28
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25927 Accepted Submission(s): 9796
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<algorithm># include<stack>using namespace std;int main(){char s1[1000];char s2[1000];int a[500];int m,n,t,i,j,k;stack<char>s;while(scanf("%d%s%s",&k,s1,s2)!=EOF) { j=t=m=n=0; while(!s.empty()) s.pop(); while(t<k) { s.push(s1[t++]); a[m++]=1; while(!s.empty()&&s.top()==s2[j]) { j++; s.pop(); a[m++]=0; }} if(!s.empty()) printf("No.\n"); else { printf("Yes.\n"); for(t=0;t<m;t++) { if(a[t]) 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 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(栈的应用+STL)
- hdu 1022 Train Problem I (栈的应用)
- HDU 1022 Train Problem I 简单的栈
- HDU.1022 Train Problem I【栈的简单应用】(3.14)
- 1022 Train Problem I 栈的简单应用
- hdu 1022 Train Problem I 简单堆栈
- HDU 1022:Train Problem I(堆栈的基本应用)
- hdu Train Problem I 栈的基本应用
- HDU 1020 Train Problem I 栈和队列的应用
- 文件重定向
- 【Matlab学习笔记】【数据类型】介绍
- python中出现IndentationError:unindent does not match any outer indentation level错误
- 【iOS开发之Objective-C】自制英汉字典项目
- C#高级编程五十九天----集合的性能
- hdu-1022 Train Problem I (栈的简单应用)
- Objective-C 省市区 字典 封装
- 我在无限互联学习记录连载1
- 杭电1870愚人节礼物 技巧性代码VS用栈代码
- 线段数_HDU_3074
- OJ网站
- 我的登山鞋
- 2000 ASCII码排序
- 极简音乐播放器(一)