A - Train Problem I
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
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 Output
Yes.
in
in
in
out
out
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.".
题意大体是 询问出栈入栈是否符合栈的规定,如果符合 输入顺序;否则no。最后finsh
代码
1 #include<cstdio>
2 #include<cstdlib>
3 #include<cstring>
4 #include<algorithm>
5 #include<vector>
6 #include<queue>
7 #include<stack>
8 #include<set>
9 #include<iostream>
10 #include<bits/stdc++.h>
11 #define ll long long
12 using namespace std;
13 int n,i,j,k,flag[20];
14 char s1[10],s2[10];
15 int main()
16 {
17 stack <char> s;
18 while(~scanf("%d",&n)){
19 memset(flag,-1,sizeof(flag));
20 cin>>s1>>s2;
21 while(!s.empty()) s.pop();
22 j=0,k=0;
23 for(int i=0;i<n;i++){
24 s.push(s1[i]);
25 flag[k++]=1;
26 while(!s.empty()&&s.top()==s2[j])
27 flag[k++]=0,s.pop(),j++;
28 }
29 if(j==n){
30 printf("Yes.\n");
31 for(int i=0;i<k;i++)
32 if(flag[i]) printf("in\n");
33 else printf("out\n");
34 printf("FINISH\n");
35 }else{
36 printf("No.\n");
37 printf("FINISH\n");
38 }
39 }
40 return 0;
41 }