HDU 1022 Train Problem I
2015-07-30 10:54
453 查看
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26092 Accepted Submission(s): 9846
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 321
3 123 312
Sample Output
Yes.
in
in
in
out
out
out
FINISH
No.
FINISH
HintHint
For the f
a4d8
irst 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.".
AC代码:
#include <iostream>
#include <stdio.h>
using namespace std;
char s[11],s1[11];
int ans[22];
char stack[11];
int main(){
int n;
while(~scanf("%d%s%s",&n,&s,&s1)){
int cnt=0,temp=0,sp=0;
for(int i=0;i<n;i++){
cnt++;
stack[cnt]=s[i];
ans[temp++]=0;
while(cnt>0&&stack[cnt]==s1[sp]){
cnt--;
sp++;
ans[temp++]=1;
}
}
if(cnt==0){
printf("Yes.\n");
for(int i=0;i<temp;i++)
if(ans[i]) printf("out\n");
else printf("in\n");
printf("FINISH\n");
}
else {
printf("No.\nFINISH\n");
}
}
}
相关文章推荐
- UVALive 6800 The Mountain of Gold (bellman_ford判负环)
- uva 11374 Airport Express(最短路)
- DataBinder.Eval和Container.DataItem(DataRowView)有什么区别
- Open-air shopping malls(二分半径,两元交面积)
- 基于CLM(Constrained local model)人脸点检测算法
- Easy 2048 Again - ZOJ 3802 像缩进dp
- 怎么提高RailS应用的性能
- Rails项目中避免滥用这三种特性
- hdu 5319 Painter(杭电多校赛第三场)
- use sleep() to gain thread predictability
- HUAS Summer Trainning #3~B
- mongodb3.0.4 MongoDB-CR Authentication failed
- Everything Will Ultimately Fail
- 2015 Multi-University Training Contest 1
- hdoj 3420 bus Fair
- 1.2-对象的建立-main
- hdu 5316 Magician 2015 Multi-University Training Contest 3
- 本文大部分参考自 http://blog.csdn.net/mayingcai1987/article/details/6200909 ,对原文中的讲解FLAG_NEW_TASK地方加了一些自己的观点
- What does __init__ == __main__ mean?
- HDU_1789_DoingHomeworkAgain