Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35735 Accepted Submission(s): 13472
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. 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,然后是两组数量为N的字符串(第一组字符串是从1到N的整数)
问把前面一个字符串的值压入栈中,能否按顺序输出第二组的数。
用栈来解决这个问题:
0。设置一个FLAG[]数组存储我们的操作。
1.每次都把栈清空,设置两个字符数组,一个IN[],一个OUT[],同时设置两个值M,N指向IN,OUT的首地址。
2.入栈:如果当前栈为空,或者栈顶的值与当前OUT[N]的值不同,就把IN[M]压入栈中。把FLAG[]标记为一。
3.出栈:如果栈顶的值与OUT[N]相同,出栈。
4.最后判断栈是否为空,为空就Yes,否则No。
代码:
#include<iostream>
#include<algorithm>
#include<stack>
#include<string>
#include<cstdio>
using namespace std;
int main()
{
char in[10], out[20];
int T;
while (cin>>T)
{
int flag[20];
int tmp = 0;
scanf("%s", in);
scanf("%s", out);
stack<char> S;
int m = 0, n = 0;
while (n<T)
{
if (S.empty()||(S.top()!=out[n])&&m<T)
{
S.push(in[m]);
m++;
flag[tmp++] = 1;
}
else
{
if (S.top() == out[n])
{
S.pop();
flag[tmp++] = 0;
n++;
}
else
break;
}
}
if (S.empty())
{
cout << "Yes." << endl;
for (int i = 0; i < tmp; i++)
{
if (flag[i])
{
cout << "in" << endl;
}
else
{
cout << "out" << endl;
}
}
}
else cout << "No." << endl;
cout << "FINISH" << endl;
}
return 0;
}