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 For 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.".
题目大意:模拟火车的进站出站,进出站规则为最后进站的火车出战之前,其他火车都不能出栈,给出火车的进站序列,和出站序列,如果出站序列正确,就依次输出每辆火车站进出顺序,进火车in,出火车out
解题思路:进站出站类型的题选择栈来做很方便,首先模拟一下,看看出栈序列是否正确,正确就输出进出站顺序,否则就输出No;
AC代码:
#include<iostream>
#include<string>
#include<stack>
using namespace std;
int main()
{
string s1,s2;
int n;
while(cin>>n>>s1>>s2)
{
int k=0;//当前出站的火车个数
stack<char> train;//保存进站的火车
char ch;
for(int i=0;i<n;i++)//用来判断能否按出站序列进行出站
{
ch=s1[i];
train.push(ch);//一辆火车进站
if(ch==s2[k])//把当前进站的火车和第一辆出站的火车比较,相等就把栈顶火车删除
{
k++;
train.pop();
if(!train.empty())//栈不为空才赋值
ch=train.top();
while(!train.empty()&&ch==s2[k])//继续判断后面的出站火车是否是前面进站的火车
{
k++;
train.pop();
if(!train.empty())
ch=train.top();
}
}
}
if(train.empty())//如果出站序列正确,那么当前栈为空
{
cout<<"Yes."<<endl;
k=0;
for(int i=0;i<n;i++)
{
ch=s1[i];
train.push(ch);//进站输出in
cout<<"in"<<endl;
if(ch==s2[k])
{
train.pop();//出站输出out
cout<<"out"<<endl;
k++;
if(!train.empty())
ch=train.top();
while(!train.empty()&&ch==s2[k])
{
k++;
train.pop();
cout<<"out"<<endl;
if(!train.empty())
ch=train.top();
}
}
}
}
else
cout<<"No."<<endl;
cout<<"FINISH"<<endl;
}
return 0;
}