Train Problem I
来源:互联网 发布:windows内核对象 编辑:程序博客网 时间:2024/06/15 11:55
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25709 Accepted Submission(s): 9707
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.
![](http://acm.hdu.edu.cn/data/images/1022-1.jpg)
![](http://acm.hdu.edu.cn/data/images/1022-2.jpg)
![](http://acm.hdu.edu.cn/data/images/1022-3.jpg)
![](http://acm.hdu.edu.cn/data/images/1022-1.jpg)
![](http://acm.hdu.edu.cn/data/images/1022-2.jpg)
![](http://acm.hdu.edu.cn/data/images/1022-3.jpg)
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///根据这两组数据可判断while语句所放位置//3//123//123////3//123//321
#include<stdio.h>
#include<string.h>#include<math.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<stack>
using namespace std;
int main()
{
int n,a[100];
char s1[15],s2[15];
while(~scanf("%d%s%s",&n,s1,s2))
{
int k,j,i;
stack<char>s;
memset(a,0,sizeof(a)); //用来标记
j=k=0;
for(i=0; i<n; i++)
{
s.push(s1[i]);
a[k++]=1;
while(!s.empty()&&s.top()==s2[j])
{
a[k++]=0;
s.pop();
j++;
}
}
if(j == n) //说明s1与s2完全相反
{
printf("Yes.\n");
for(i = 0; i < k; i++)
{
if(a[i])
printf("in\n");
else
printf("out\n");
}
}
else
printf("No.\n");
printf("FINISH\n");
}
return 0;
}
0 0
- 1022 Train Problem I
- HDU1022 Train Problem I
- Train Problem I
- 1022:Train Problem I
- 1022 Train Problem I
- HDU1022 Train Problem I
- Train Problem I
- HDU1022:Train Problem I
- HDU1022--Train Problem I
- Train Problem I
- hdu1022-Train Problem I
- HDU1022 Train Problem I
- hdu1022 Train Problem I
- Train Problem I
- Train Problem I
- Train Problem I
- D. Train Problem I
- Train Problem I
- 基于CentOS的MySQL学习补充四--使用Shell批量从CSV文件中插入数据到数据表
- PHP操作MongoDB学习笔记
- android bitmap 获取像素
- processing图形化编程实例:打飞机游戏
- GRE写作必备句型
- Train Problem I
- 机器学习浅谈
- QObject怎样把ppt嵌入qt widget里显示,并控制自动播放
- java下的zving旧框架使用经验
- 全局组,通用组,和域本地组的区别
- 数据结构笔记之----查找
- hls流媒体:ts流格式介绍
- HDU1106 排序
- 生成xml格式文件