hdu 1022 栈的应用
来源:互联网 发布:pe工具 知乎 编辑:程序博客网 时间:2024/06/05 14:20
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
题解:
参考了紫书中的代码。
用string wrong answer好几次。换char 加了个条件A<=n水过
代码:
#include <iostream>#include <stack>#include <vector>#include <string>#include <cstdio>using namespace std;const int maxn = 1000+10;char orig[maxn],target[maxn];vector<string> vec;int main(){ int n; while(cin>>n) { scanf("%s %s",orig+1,target+1); stack<char> s; int A=1,B=1; bool ok=1; while(B<=n) { if(orig[A]==target[B]) {A++;B++;vec.push_back("in");vec.push_back("out");} else if(!s.empty()&&s.top()==target[B]) {s.pop();B++;vec.push_back("out");} else if((orig[A]-'0')<=n&&A<=n) {s.push(orig[A]);A++;vec.push_back("in");} else {ok=0;break;} } if(ok) { printf("Yes.\n"); for(int i=0;i<vec.size();i++) cout<<vec[i]<<endl; printf("FINISH\n"); } else { printf("No.\n"); printf("FINISH\n"); } vec.clear(); } return 0;}
- hdu-1022 栈的应用。
- hdu 1022 栈的应用
- hdu 1022(栈的应用)
- HDU 1022 栈的基本操作应用
- hdu 1022 简单的栈应用
- HDU 1022 堆栈的应用
- hdu 1082 栈的应用
- HDU 5479(栈的应用)
- hdu 1022 简单栈应用
- hdu 1022 Train Problem I(栈的应用。。。)
- hdu 1022 Train Problem I(栈的应用)
- hdu 1022——STL中栈的应用
- hdu 1022 Train Problem I (栈的简单应用)
- hdu 1022 (栈)STL容器的应用
- HDU 1022 Train Problem I(栈的应用)
- hdu 1022 Train Problem I (栈的应用)
- hdu 1022 Train Problem I_栈的应用经典例题
- hdu 1022 Train Problem I(栈的应用+STL)
- 关于react-native的适配与布局方式
- 【Leetcode】【python】Merge k Sorted Lists
- YP2.1 Bits and Data Types (双语)
- Android并发编程之全方位解析AsyncTask
- Android并发编程之如何使用ReentrantReadWriteLock替代synchronized来提高程序的效率
- hdu 1022 栈的应用
- hdu 1039
- 动物书:PHP经典实例(第三版)小错误
- hdu 1023
- 001
- 【tyvj1068】STR(KMP||hash)
- 关于MySQL升级和安装中Table 'performance_schema.session_variables' doesn't exist(某表不存在)的错误
- win10下安装web3失败问题
- 26-SpringBoot——核心-Spring Data REST