HDU 1702-Train Problem I

Train Problem I

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 38955    Accepted Submission(s): 14669


题目链接：点击打开链接

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 3213 123 312

 

Sample Output

Yes.inininoutoutoutFINISHNo.FINISH
Hint
Hint
 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.".

题意：每辆火车进站，会有n辆车进站，现在给出n，给你字符串 s1 和 s2  ，代表火车进站的顺序和出站的顺序，让你判断火车按s1进站，能否按s2 的顺序出站，如果可以则输出Yes. ，并且输出车的进站和出站次序，这里要注意两点，第一，后进去的火车先出，先进去的火车后去。第二，某一辆火车进去后也可以立即出来。

分析：考察对栈的应用，但要注意对进站和出站的控制。

#include <iostream>#include<stack>#include<stdio.h>#include<string.h>#include<string>using namespace std;int main(){    int n,k,j,bj[50];    char s1[15],s2[15];    while(~scanf("%d %s%s",&n,s1,s2))    {        stack<char> s;        memset(bj,-1,sizeof(bj));        k=j=0;        for(int i=0;i<n;i++)        {            s.push(s1[i]);            bj[k++]=1;//bj数组如果为1代表进站，如果为0代表出站            while(!s.empty()&&s.top()==s2[j])            {                bj[k++]=0;                s.pop();                j++;            }        }        if(j==n)        {            printf("Yes.\n");            for(int i=0;i<k;i++)            {                if(bj[i])                    printf("in\n");                else                    printf("out\n");            }        }        else            printf("No.\n");        printf("FINISH\n");    }    return 0;}