HDU 1022 Train Problem I
来源:互联网 发布:2016淘宝联盟提现 编辑:程序博客网 时间:2024/06/05 14:56
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22420 Accepted Submission(s): 8481
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 3213 123 312
Sample Output
Yes.inininoutoutoutFINISHNo.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.HintHintSo we output "No.".
只是很简单的模拟,脑子跟不上思路,答案都不对,程序思维太差!
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;char o1[1005],o2[1005],stack[1005];int main(void){ int n; while(scanf("%d",&n)!=EOF) { scanf("%s %s",o1,o2); int top=0,rail=0; for(int i=0;i<n;i++) { stack[top++]=o1[i]; while(stack[top-1]==o2[rail]&&top>=0&&rail<n) { top--; rail++; } // printf("top: %d\n",top); } if(top>0&&rail<n) printf("No.\n"); else { rail=0; printf("Yes.\n"); for(int i=0;i<n;i++) { stack[top++]=o1[i]; printf("in\n"); // printf("top: %d\n",top); while(stack[top-1]==o2[rail]&&rail<n) { top--; printf("out\n"); rail++; // printf("top: %d\n",top); } } } printf("FINISH\n"); } return 0;}
0 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
- 设计模式——六大原则(下)
- Think PHP 3.2学习经验
- SQL常用函数集锦
- linux下elf重定位理解
- c,回调函数。理解
- HDU 1022 Train Problem I
- 经典收藏 50个jQuery Mobile开发技巧集萃
- cuda invalid device function 错误改正
- 单独一台机器测试OpenVPN加密隧道的问题和解决
- 使用JDBC链接数据库之连接数据库通用工具类
- 第一部分 数理逻辑 第五章 一阶逻辑等值演算与推理
- 股票配资网站优化实录(四)
- jquery 瀑布流自动加载数据方法
- ORACLE日期时间函数大全