注册 登录  
 加关注
查看详情
   显示下一条  |  关闭
温馨提示!由于新浪微博认证机制调整,您的新浪微博帐号绑定已过期,请重新绑定!立即重新绑定新浪微博》  |  关闭

Minary_Acdream

http://f10.moe/

 
 
 

日志

 
 

[hdu]1022 Train Problem I  

2012-08-13 18:55:39|  分类: HDU |  标签: |举报 |字号 订阅

  下载LOFTER 我的照片书  |
老实说,看到这么图文并茂的题目先慌了一下,但是仔细一读就是个栈的应用。

题目:

Train Problem I

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11414    Accepted Submission(s): 4160


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.
[hdu]1022 Train Problem I - Minary - Minary_Acdream[hdu]1022 Train Problem I - Minary - Minary_Acdream[hdu]1022 Train Problem I - Minary - Minary_Acdream
 

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
 





#include<iostream>
#include<cmath>
#include<stack>
using namespace std;
int c[10001];
int main()
{
int n;
while(cin>>n)
{
stack<char> train;
string zro,orz;
cin>>zro>>orz;
int j = 0,k = 0;
for(int i = 0;i < n;i ++)
{
train.push(zro[i]);
c[k] = 1;
k++;
while(j <= n && !train.empty())
{
if(train.top() == orz[j])
{
train.pop(); //则弹出该元素
c[k] = 0; //标记为已出栈
k++;
j++;
}
else break;
}
}

if(train.empty())
{
cout<<"Yes."<<endl;
for(int i = 0;i < k;i ++)
{
if(c[i] == 1)cout<<"in"<<endl;
else cout<<"out"<<endl;
}
}
else cout<<"No."<<endl;
cout<<"FINISH"<<endl;

}

}


/*
Sample Input
3 123 321
3 123 312


Sample Output
Yes.
in
in
in
out
out
out
FINISH
No.
FINISH
*/



  评论这张
 
阅读(127)| 评论(0)
推荐 转载

历史上的今天

在LOFTER的更多文章

评论

<#--最新日志,群博日志--> <#--推荐日志--> <#--引用记录--> <#--博主推荐--> <#--随机阅读--> <#--首页推荐--> <#--历史上的今天--> <#--被推荐日志--> <#--上一篇,下一篇--> <#-- 热度 --> <#-- 网易新闻广告 --> <#--右边模块结构--> <#--评论模块结构--> <#--引用模块结构--> <#--博主发起的投票-->
 
 
 
 
 
 
 
 
 
 
 
 
 
 

页脚

网易公司版权所有 ©1997-2018