hdoj 1022 Train Problem I【栈】
来源:互联网 发布:淘宝销售团队 编辑:程序博客网 时间:2024/05/11 21:46
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26563 Accepted Submission(s): 10043
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>using namespace std;int main(){ int i,j,k,n; char in[10],out[10]; int a[20]; stack<char>s; while(scanf("%d",&n)!=EOF) { getchar(); scanf("%s%s",in,out); memset(a,-1,sizeof(a)); while(!s.empty()) s.pop(); i=j=k=0; while(i<n) { s.push(in[i++]); a[j++]=1; while(!s.empty()&&s.top()==out[k]) { k++; a[j++]=0; s.pop(); } } if(s.empty()) { printf("Yes.\n"); for(i=0;i<j;i++) { if(a[i]) printf("in\n"); else printf("out\n"); } printf("FINISH\n"); } else printf("No.\nFINISH\n"); } return 0; }
0 0
- hdoj 1022 Train Problem I 【顺序栈】
- HDOJ 1022 Train Problem I(栈)
- HDOJ Train Problem I 1022(栈)
- HDOJ 1022 Train Problem I(简单栈)
- hdoj-1022-Train Problem I(栈)
- HDOJ 1022 Train Problem I(栈)
- hdoj 1022 Train Problem I【栈】
- hdoj 1022 Train Problem I(栈)
- HDOJ 1022 Train Problem I
- HDOJ 1022 Train Problem I
- HDOJ 1022 Train Problem I
- hdoj 1022 Train Problem I
- HDOJ 1022 Train Problem I
- hdoj 1022Train Problem I
- hdoj 1022 Train Problem I
- HDOJ Train Problem I
- HDOJ Train Problem I
- HDOJ题目1022Train Problem I(栈的模拟)
- 使用dup和dup2重定向和还原 http://blog.csdn.net/kangear/article/details/24098315
- 第四章 面向对象整理
- python Selenium安装、启动设置、基本操作
- 代理
- 黑马程序员——java基础知识篇——>if语句、switch语句
- hdoj 1022 Train Problem I【栈】
- C++的const类成员函数
- android studio 使用aar资源包
- iOS 平台 Cocos2d-x 项目接入新浪微博 SDK 的坑
- LeetCode Rotate Array
- 距离
- 在Windows平台上安装Node.js及NPM模块管理
- Java基础
- 测试总结报告