hdu杭电1002 Train Problem I【栈】
来源:互联网 发布:python 答题系统 编辑:程序博客网 时间:2024/06/05 03:59
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
//如果不会用STL的话,看看这个代码
#include<stdio.h>#define max 110char s[max];char s1[max],s2[max];int main(){ int n,flag[max]; while(~scanf("%d %s %s",&n,s1,s2)) { int i=0,j=0; s[1]=s1[i]; flag[1]=1; int k=1,l=1; while(i<n&&j<n) { if(l!=0&&s[l]==s2[j]){++j;--l;flag[++k]=0;}else{s[++l]=s1[++i];flag[++k]=1;} } if(l!=0) printf("No.\n"); else { printf("Yes.\n"); for(i=1;i<=k;++i) { if(flag[i])printf("in\n"); else printf("out\n"); } } printf("FINISH\n"); } return 0;}
#include<stack>#include<cstdio>#define max 110using namespace std;stack<char>s;char s1[max],s2[max];int main(){ int n,flag[max]; while(~scanf("%d %s %s",&n,s1,s2)) { int i=0,j=0; s.push(s1[i]); flag[1]=1; int k=1; while(i<n&&j<n) { if(!s.empty()&&s.top()==s2[j]){++j;s.pop();flag[++k]=0;}else{s.push(s1[++i]);flag[++k]=1;} } if(!s.empty()) printf("No.\n"); else { printf("Yes.\n"); for(i=1;i<=k;++i) { if(flag[i])printf("in\n"); else printf("out\n"); } } printf("FINISH\n"); while(!s.empty())s.pop();//栈的清空 ,因为当栈不为空的话会影响下一组数据 } return 0;}
0 0
- hdu杭电1002 Train Problem I【栈】
- 杭电 ACM HDU Train Problem I
- 杭电 hdu 1022. Train Problem I
- 杭电hdu 1022 Train Problem I 栈
- 杭电Train Problem I
- hdu Train Problem I (栈 )
- 杭电1022 Train Problem I(栈)
- 【杭电oj】1022 - Train Problem I(栈)
- 【杭电-oj】-1022-Train Problem I (栈,好)
- 杭电1022 Train Problem I
- 杭电OJ--1021 Train Problem I
- 【ACM】杭电1022:Train Problem I
- 杭电1022-Train Problem I
- 杭电1022 Train Problem I
- 杭电OJ 1022:Train Problem I
- 杭电ACM 1022 Train Problem I
- 杭电1022 Train Problem I
- 杭电1022 Train Problem I
- linux 获取当前目录名的方法
- 百度地图开发
- android 关于Make sure the plugin is properly configured问题的解决办法
- 实习记录
- D的小L
- hdu杭电1002 Train Problem I【栈】
- Openmpi安装
- JVM 进阶 一
- Container With Most Water
- Realflow制作融化特效
- 用Python进行自然语言处理-2. Accessing Text Corpora and Lexical Resources
- 关于python在cmd中输出中文乱码的问题
- 原地随机排列数组
- lsdk无线驱动与管理层的接口