Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41964 Accepted Submission(s): 15692
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.
![](https://i-blog.csdnimg.cn/blog_migrate/e07a7819adc3fce5ee075d011a0a1d3a.jpeg)
![](https://i-blog.csdnimg.cn/blog_migrate/3ed5e24625225c0a75f84ac6dbeceabe.jpeg)
![](https://i-blog.csdnimg.cn/blog_migrate/b72889e34d63c9ba1c9624e8d50888c9.jpeg)
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. 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
Author
Ignatius.L
【题目大意】
给定n个火车进入车站的顺序s1,问能否按照s2的顺序出站。
【解题思路】
图示很明显是一个栈的模型,不过火车选择出站的时间是不固定的。模拟。
利用stack,栈不为空且top恰好为该出战的火车时pop。注意进入和出去的遍历时独立的。
【解题代码】
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
using namespace std;
const int maxn=100;
stack <int> s;
char n1[maxn],n2[maxn];
bool flag[maxn];
int n;
int main()
{
while(~scanf("%d",&n))
{
while(!s.empty()) s.pop();
memset(flag,0,sizeof(flag));
memset(flag,0,sizeof(flag));
scanf("%s%s",n1,n2);
int i,j,k;
j=k=0;
for(i=0;i<n;i++)
{
s.push(n1[i]);
flag[k++]=1;
while(!s.empty()&&s.top()==n2[j])
{
flag[k++]=0;
s.pop();
j++;
}
}
if(j==n) //或者判断 if(s.empty()) 但是调用函数肯定要慢一些
{
printf("Yes.\n");
for(i=0;i<2*n;i++)
{
if(flag[i]) printf("in\n");
else printf("out\n");
}
}
else printf("No.\n");
printf("FINISH\n");
}
return 0;
}
【收获与反思】
1.加了判断和要求的进出栈,需要模拟。
2.进入的i和出去的j独立遍历,i只控制进入的遍历,j控制出的遍历。不来回走,都只扫一遍。检测j是否到头就可以(或者栈是否为空。