Train Problem I(栈和队列)
2017-07-20 10:15
274 查看
Train Problem ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37863 Accepted Submission(s): 14231 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 321 3 123 312 Sample Output Yes. in in in out out out FINISH No. FINISH HintHint 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.". #include<stdio.h> #include<stack> #include<string.h> #include<queue> #include<string> #include<iostream> using namespace std; int main(){ int n; while(scanf("%d",&n)!=EOF){ stack<char>st; queue<string>st2; char str[1000]; char str1[1000]; scanf("%s%s",str,str1); int j=0; for(int i=0;i<n;i++) { st.push(str[i]); st2.push("in"); while(!st.empty()&&st.top()==str1[j]) { st.pop(); st2.push("out"); j++; } } if(j==n) { printf("Yes.\n"); while(!st2.empty()){ cout<<st2.front()<<endl; st2.pop(); } } else printf("No.\n"); printf("FINISH\n"); } } |
Train Problem ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37863 Accepted Submission(s): 14231 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 321 3 123 312 Sample Output Yes. in in in out out out FINISH No. FINISH HintHint 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 |
相关文章推荐
- hdu1076 Train Problem I(栈和队列问题)
- HDU 1022 Train Problem I 栈和队列
- Train Problem I(栈和队列)
- HDU 1023 Train Problem II (卡特兰数)
- HDU 2993 MAX Average Problem(斜率优化入门+单调队列)
- HDU:1022 Train Problem I
- hdu 1022 Train Problem I
- HDU 1022:Train Problem I(堆栈的基本应用)
- HDU 【1022】Train Problem I
- HDU 3706 Second My Problem First 【单调队列】
- hdu 1023 Train Problem II (卡特兰数)
- hdu Train Problem I(stack栈)
- HDU 1023 Train Problem II(Catalan + 大数)
- 【ACM】hdu_zs3_1008_Train Problem I_201308100835
- HDOJ 1023 Train Problem II
- Java 杭电ACM Train Problem I 1022
- hdu1023 Train Problem II
- HDU 1022 Train Problem I 附详细思路
- Train Problem II
- hdu 1023 Train Problem II