【HDU - 1022】Train Problem I （栈模拟，水题，思维）

题干：

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

Hint

Hint

解题报告：

刚开始天真的以为直接翻转数组，如果匹配就YES否则就NO。但是一想这题没这么简单，因为比如：我一共要停4辆车，我可以先停三辆，然后出两辆，然后再进一辆，这样也是符合题意的。

别忘了这里用了数据结构，所以任何操作都必须判断一步栈是否为空。

AC代码：

#include<bits/stdc++.h>using namespace std;
int opr[1005];
int main()
{char in[15],out[15];int n;while(~scanf("%d",&n)) {int top = 0;scanf("%s%s",in,out);stack<char > sk;int cur=0;for(int i = 0; i<n; i++) {sk.push(in[i]);opr[++top] = 1;if(sk.size()) {while(sk.size() && sk.top() == out[cur]) {cur++;sk.pop();opr[++top] = 0;}} }if(sk.empty()) {puts("Yes.");for(int i = 1; i<=top; i++) {opr[i] == 1 ? puts("in") : puts("out");}}else puts("No.");puts("FINISH");}return 0 ;
}

【HDU - 1022】Train Problem I （栈模拟，水题，思维）相关推荐

HDU 1022[Train Problem I] 栈的应用
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1022 题目大意:一列序列为s1的车厢是否能通过车站的中转以序列s2出站.白皮上有. 关键思想:栈的应用 ...
hdu 1022 Train Problem I 解题报告
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1022 其实是一道上数据结构课讲过的例题只不过当时讲的是怎么用手算一道水题又花了好长时间其实就 ...
hdu 1022 Train Problem I（栈）
标记现在已经匹配到o1的第几列车了,o2从头开始,如果不匹配把o1就放入栈中,匹配后出栈并比较栈顶与o1的下一辆,匹配继续出,不匹配就继续进栈 1 #include <iostream> ...
HDU 1022 Train Problem I stack 基础题
题意: 有一个火车站,只有一个口同时用于进入和出去,但不能有2辆或以上同时进出. 给出一个n代表有n辆火车(n<=9),编号分别为1到n. 然后给出2个序列,分别代表火车进站的顺序,火车出站的顺 ...
【HDU 1889】Reaux! Sham! Beaux!(模拟+水题)
传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1889 题意:给出一个表,每个国家的石头剪子布的叫法,给两个人用自己国家的语言进行石头剪子布,进行统计,最 ...
train problem I (栈水题)
杭电1002http://acm.hdu.edu.cn/showproblem.php?pid=1022 Train Problem I Time Limit: 2000/1000 MS (Java/ ...
【HDOJ】1022 Train Problem I_天涯浪子_新浪博客
[题目]http://acm.hdu.edu.cn/showproblem.php?pid=1022 [报告] 模拟,直接模拟一个栈的运行就行了. [程序] // Task: 1022 Train P ...
【CCCC】L2-027 名人堂与代金券 (25分)，模拟水题
problem L2-027 名人堂与代金券 (25分) 对于在中国大学MOOC(http://www.icourse163.org/ )学习"数据结构"课程的学生,想要获得一张合 ...
洛谷 1563 玩具谜题——模拟水题
题目:https://www.luogu.org/problemnew/show/P1563 模拟水题. #include<iostream> #include<cstdio> ...
hdu 1023 Train Problem II
题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=1212 Train Problem II Description As we all know the ...

【HDU - 1022】Train Problem I （栈模拟，水题，思维）

【HDU - 1022】Train Problem I （栈模拟，水题，思维）相关推荐

最新文章

热门文章