hdoj 1022 Train Problem I(用栈解决法)
来源:互联网 发布:淡斑 知乎 编辑:程序博客网 时间:2024/04/28 08:00
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20743 Accepted Submission(s): 7806
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
AC CODE:
#include<string.h>#include<cstdio>int main(){int top,i,j,k,count[20],n;char o1[20],o2[20],temp[20];while(~scanf("%d%s%s",&n,o1,o2)){top=1;i=j=k=0;while(i<n&&j<n+1) //i++为o2出栈,j++为o1进栈 {if(top!=1&&o2[i]==temp[top-1]) //出栈 {i++,top--;count[k++]=0;}else //进栈 {temp[top]=o1[j];j++,top++;count[k++]=1;}}if(top==1) //也可以是 if(k==2*n) {printf("Yes.\n");for(i=0;i<k;i++)if(count[i]==0)printf("out\n");elseprintf("in\n");}elseprintf("No.\n");printf("FINISH\n");}return 0;}
0 0
- 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题目1022Train 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
- Freemodbus RTU在stm32上的移植分析
- HDU 3729 I'm Telling the Truth(二分图最大匹配)
- 本地js页面
- JAXB基本类型对应关系
- HDU 3549 Flow Problem
- hdoj 1022 Train Problem I(用栈解决法)
- Linux mint 下安装Fcitx中文输入法
- POJ3249 Test for Job 【DAG】+【记忆化搜索】
- 图片加水印工具类
- hdu3549 Flow Problem
- 秒杀多线程第十篇 生产者消费者问题
- 用WebCollector做Web挖掘(实例1)
- google 2015最新的校招测试题与思路
- TCP协议状态图