train problem i java_Train Problem I

Myth丶恋晨 2022-10-23 11:23 163阅读 0赞

Train

Problem I

Time

Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K

(Java/Other)

Total

Submission(s) : 35   Accepted Submission(s) : 14

Font:Times New Roman|Verdana|Georgia

Font

Size:←→

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.

![e07a7819adc3fce5ee075d011a0a1d3a.png][]

![3ed5e24625225c0a75f84ac6dbeceabe.png][]

![b72889e34d63c9ba1c9624e8d50888c9.png][]

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.

out

FINISH

No.

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.".

Author

Ignatius.L

![cdec0645add3fc3c328197dda5c76203.png][]

![81178cc93a2a3bb5048d90d76e7ec935.png][]

1 \#include

2 \#include

3 \#include

5 intmain()6 \{7 intNUM,Len,i,j,k,sign,Top;8 char str\[10000\],flat\[10000\],FLAT\[10000\],SIGN\[10000\];9 while(scanf("%d",&NUM)!=EOF)10 \{11 memset(flat,0,sizeof(flat));12 memset(FLAT,0,sizeof(FLAT));13 memset(FLAT,0,sizeof(FLAT));14 getchar();15 scanf("%s%s",flat,FLAT);16 for(i=0,j=0,k=0,sign=0,Top=0;k<=NUM&&j<=NUM;)17 \{18 if(Top>=0&&k>0&&str\[Top\]==FLAT\[j\])19 \{20 str\[Top\]=‘\\0‘;21 Top-=1;k-=1;j++;22 if(Top==0&&j>=NUM)break;23 SIGN\[sign++\]=1;24 \}25 else

26 \{str\[k++\]=flat\[i++\];Top=k-1;SIGN\[sign++\]=0;\}27 str\[k\]=‘\\0‘;28 \}29 str\[k\]=‘\\0‘;30 if(str\[0\]==‘\\0‘)31 \{32 printf("Yes.\\n");33 for(i=0;i

39 \}40 else

41 printf("No.\\n");42 printf("FINISH\\n");43 \}44

47 \}

原文：http://www.cnblogs.com/LWF5201314614/p/3750317.html

[e07a7819adc3fce5ee075d011a0a1d3a.png]: /images/20221023/6098d30f43a54bf18fa24b353ca3b2d6.png
[3ed5e24625225c0a75f84ac6dbeceabe.png]: /images/20221023/4466a0bd795c40b090e00669c5dbba32.png
[b72889e34d63c9ba1c9624e8d50888c9.png]: /images/20221023/cdd139a380c74dbc850f18f2e4936cb4.png
[cdec0645add3fc3c328197dda5c76203.png]: /images/20221023/6be2587d26694ebab2a5548d9ac24ae3.png
[81178cc93a2a3bb5048d90d76e7ec935.png]: /images/20221023/6814f84aa27d47f6a712addc11c45bdc.png