As the new term comes, the Ignatius Train Station is verybusy nowadays. A lot of student want to get back to school by train(because thetrains 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. Forthis problem, if train A gets into the railway first, and then train B getsinto the railway before train A leaves, train A can't leave until train Bleaves. 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(numberedfrom 1 to n), the trains get into the railway in an order O1, your task is todetermine whether the trains can get out in an order O2.
Input
The input contains several test cases. Each test caseconsists of an integer, the number of trains, and two strings, the order of thetrains come in:O1, and the order of the trains leave:O2. The input isterminated by the end of file. More details in the Sample Input.
Output
The output contains a string "No." if you can'texchange O2 to O1, or you should output a line contains "Yes.", andthen output your way in exchanging the order(you should output "in"for a train getting into the railway, and "out" for a train gettingout of the railway). Print a line contains "FINISH" after each testcase. 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
For the first Sample Input, we let train 1get 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 lettrain 3 leave first, so we have to let train 1 get in, then train 2 and train3.
Now we can let train 3 leave.
But after that we can't let train 1 leavebefore train 2, because train 2 is at the top of the railway at the moment.
So we output "No.".
Hint
Hint
思路:
使用栈进行模拟,用数组记录进出。
代码如下:
#include<iostream>
#include<stack>
#include<cstring>
#include<string>
#include<cstdio>
using namespace std;
int main()
{
int n; int xijie[100]; string jin, target;
while (cin>>n>>jin>> target)
{
stack<int>s;
int flag = 1;
int A = 0, B = 0; int index = 0;
while (B<n)
{
if (jin[A] == target[B])
{
xijie[index++] = 1;
xijie[index++] = 0;
A++; B++;
}
else if (!s.empty() && s.top() == target[B])
{
s.pop(); B++;
xijie[index++] = 0;
}
else if (A <n)
{
s.push(jin[A++]);
xijie[index++] = 1;
}
else
{
flag = 0; break;
}
}
if (flag)
{
cout << "Yes." << endl;
for (int i = 0; i < index; i++)
{
if (xijie[i])cout << "in" << endl;
else cout << "out" << endl;
}
cout << "FINISH" << endl;
}
else
{
cout << "No." << endl;
cout << "FINISH" << endl;
}
}
return 0;
}