Train Problem I 栈
来源:互联网 发布:linux怎么重命名文件 编辑:程序博客网 时间:2024/06/11 01:42
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38515 Accepted Submission(s): 14480
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.So we output "No.".HintHint
Author
Ignatius.L
source
HDU 1022
这题也是栈的题,给出入栈顺序,再给出字符串 让判断是否满足出栈顺序;
要先判断是否满足,满足的话再把进出的顺序输出
#include <iostream>
#include<stack>
#include<string>
using namespace std;
char a[11100],b[11100];
int n,i,j,k;
int main()
{
while(cin>>n)
{
cin>>a;
cin>>b;
stack<char >s;
for(i=0,k=0;i<n; )
{
if(a[i]!=b[k])
{
s.push(a[i]);
i++;
}
else
{
s.push(a[i]);
while(!s.empty()&&s.top()==b[k]&&k<n)
{
s.pop();
k++;
}
i++;
}
}
if(s.empty())
{
cout<<"Yes."<<endl;
for(i=0,k=0;i<n; )
{
if(a[i]!=b[k])
{
s.push(a[i]);
cout<<"in"<<endl;
i++;
}
else
{
s.push(a[i]);
cout<<"in"<<endl;
while(!s.empty()&&s.top()==b[k]&&k<n)
{
s.pop();
cout<<"out"<<endl;
k++;
}
i++;
}
}
}
else
{
cout<<"No."<<endl;
}
cout<<"FINISH"<<endl;
}
return 0;
}
#include<stack>
#include<string>
using namespace std;
char a[11100],b[11100];
int n,i,j,k;
int main()
{
while(cin>>n)
{
cin>>a;
cin>>b;
stack<char >s;
for(i=0,k=0;i<n; )
{
if(a[i]!=b[k])
{
s.push(a[i]);
i++;
}
else
{
s.push(a[i]);
while(!s.empty()&&s.top()==b[k]&&k<n)
{
s.pop();
k++;
}
i++;
}
}
if(s.empty())
{
cout<<"Yes."<<endl;
for(i=0,k=0;i<n; )
{
if(a[i]!=b[k])
{
s.push(a[i]);
cout<<"in"<<endl;
i++;
}
else
{
s.push(a[i]);
cout<<"in"<<endl;
while(!s.empty()&&s.top()==b[k]&&k<n)
{
s.pop();
cout<<"out"<<endl;
k++;
}
i++;
}
}
}
else
{
cout<<"No."<<endl;
}
cout<<"FINISH"<<endl;
}
return 0;
}
人一我百!人十我万!永不放弃~~~怀着自信的心,去追逐梦想。
阅读全文
0 0
- Train Problem I 栈
- hdoj1022------------------Train Problem I---栈
- Train Problem I(栈)
- NYOJ150 Train Problem I 【栈】
- hdu Train Problem I (栈 )
- Train Problem I(栈)
- HDU1022--Train Problem I(栈)
- hdu 1022 Train Problem I 栈
- Train Problem I hdu 1022 栈
- hdu 1022 Train Problem I(栈)
- hdu 1022 Train problem I(栈~~)
- NYOJ 150 Train Problem I 【栈】
- HDOJ1022 Train Problem I 栈模拟
- HDU 1022 Train Problem I 栈、队列
- NYOJ 150 Train Problem I STL栈
- hdu 1022 Train Problem I(栈)
- HDU 1022 Train Problem I (栈)
- Train Problem I(栈和队列)
- 快速了解Maven,Ant,Gradle的概念
- XYNU OJ 1073: 习题5-3-2 求最大公约数
- 欢迎使用CSDN-markdown编辑器
- 学前段半个月的一些心得(四)
- AB1601串口之bugs
- Train Problem I 栈
- Mac Eclipse
- Ceres-Solver学习笔记(8)
- 2017多校第二场 HDU 6049 Sdjpx Is Happy 区间DP,复杂度优化
- <Paper Reading>Brain dynamics
- LOJ #6006. 试题库 (简单最大流+输出可行路径)
- Android工具类: 基于Zxing的二维码生成和展示
- 7confirm消息对话框
- zepto和jquery的区别