HDU 1022 Train Problem I
来源:互联网 发布:lol美服账号购买 淘宝 编辑:程序博客网 时间:2024/06/06 15:54
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 38888 Accepted Submission(s): 14638
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
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
這個題就是來詢問能補鞥通過這個類似於棧的東西,來吧一個字符串A轉換成字符串B。
我們通過棧來模擬 並且進行保存就可以了。
棧的基本應用
#include<iostream>#include<stdio.h> #include<string.h> #include<stack> using namespace std;int main(){ int n, i, j, k, v[50]; char s1[15], s2[15]; stack <char> s; while (~scanf("%d %s%s", &n, s1, s2)) { while (!s.empty()) s.pop(); //清空當前棧 memset(v, -1, sizeof(v)); j = k = 0; for (i = 0; i < n; i++) { s.push(s1[i]); v[k++] = 1; while (!s.empty() && s.top() == s2[j]) { v[k++] = 0; s.pop(); j++; } } if (j == n) { printf("Yes.\n"); for (i = 0; i < k; i++) { if (v[i]) printf("in\n"); else printf("out\n"); } } else printf("No.\n"); printf("FINISH\n"); } return 0;}
- HDU 1022 Train Problem I
- HDU-1022 Train Problem I
- HDU 1022 Train Problem I
- HDU 1022 ( Train Problem I )
- HDU 1022 Train Problem I
- HDU 1022 Train Problem I
- Hdu 1022 - Train Problem I
- HDU-1022:Train Problem I
- hdu 1022 Train Problem I
- hdu 1022 Train Problem I
- hdu-Train Problem I-1022
- hdu 1022 Train Problem I
- hdu 1022 Train Problem I
- hdu 1022 Train Problem I
- HDU 1022 Train Problem I
- hdu 1022 Train Problem I
- hdu 1022 Train Problem I
- HDU 1022Train Problem I
- 编写可以在Qt4、Qt5中同时执行的代码
- POI 海量数据/大数据文件生成SXSSFWorkbook使用简介
- org. apache.cxf /WebService在项目中的使用
- UVA437
- Android项目方法数超过64k问题(项目总方法数超过65535)
- HDU 1022 Train Problem I
- Super Jumping! Jumping! Jumping!(dp)【HDU】-1087
- postman工具的应用实战(二)
- git练习
- Spring支持的AspectJ注解式切面编程
- Linux驱动基础开发 Linux 驱动开发前奏(模块编程)
- M
- redis详解(一)
- Android开源库整理(3)