hdu1022 Train Problem I 数据结构--栈
来源:互联网 发布:三唑仑在淘宝能买到吗 编辑:程序博客网 时间:2024/06/06 13:48
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33846 Accepted Submission(s): 12744
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
这个题意很迷。。。。题目给的样例很误导。。。请看这组:
512342 24321Yes.ininoutininoutoutinoutoutFINISH代码:
/* ━━━━━┒ ┓┏┓┏┓┃μ'sic foever!! ┛┗┛┗┛┃\○/ ┓┏┓┏┓┃ / ┛┗┛┗┛┃ノ) ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┃┃┃┃┃┃ ┻┻┻┻┻┻ */#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <map>#include <stack>#include <vector>using namespace std;const int maxn = 1e5;stack<int> now;vector<string> ans;int main(){ int n,i,j; string a,b; while(~scanf("%d",&n)){ while (now.size()) { now.pop(); } ans.clear(); cin>>a>>b; int len = a.length(); int p = 0; i = -1; while(p<len&&i<len){ //printf("in\n"); ans.push_back("in\n"); now.push(a[++i]-'0'); while(now.size()&&now.top()==b[p]-'0'){ //printf("out\n"); ans.push_back("out\n"); now.pop(); p++; } } if(now.size()){ printf("No.\n"); }else{ printf("Yes.\n"); for(i=0;i<ans.size();i++){ cout<<ans[i]; } } printf("FINISH\n"); } return 0;}
0 0
- hdu1022 Train Problem I 数据结构--栈
- HDU1022 Train Problem I 数据结构
- HDU1022--Train Problem I(栈)
- HDU1022 acm 数据结构 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
- switch to frame nosuchElement
- 消息队列的使用场景
- linux下设置允许keepalived组播
- C语言指针背景--变量与内存
- 关于tomcat
- hdu1022 Train Problem I 数据结构--栈
- 文字记录而已!!人民币直充/兑换PayPal美金
- Android Studio工程目录结构分析(上)
- 《告诉你外语学习的真实方法及误区分析》
- Android中获取网络图片
- python题目-----序列反序操作
- c++primer笔记之数组与指针的一些总结
- 3.快速排序——啊哈算法java实现
- Stale Element Reference Exception