HDU-1022 Train Problem I
来源:互联网 发布:门业销售软件 编辑:程序博客网 时间:2024/06/04 08:25
/*Train Problem I
时间限制:3000 ms | 内存限制:65535 KB
难度:2
描述
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.
输入
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.
输出
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.
样例输入
3 123 321
3 123 312
样例输出
Yes.
in
in
in
out
out
out
FINISH
No.
FINISH
*/
#include<stdio.h>
#include<stack>
using namespace std;
int main()
{
int n,d[100];
char b[100],c[100];
while(scanf("%d %s %s",&n,b,c)!=EOF)
{
stack<char>t;
int i=0,j=0,k=0;
for(i=0;i<n;i++)
{
t.push(b[i]);
d[k]=1;
k++;
while(!t.empty()&&t.top()==c[j])
{
j++;
d[k]=0;
k++;
t.pop();
}
}
if(!t.empty())
printf("No.\n");
else
{
printf("Yes.\n");
for(i=0;i<k;i++)
if(d[i])
printf("in\n");
else
printf("out\n");
}
printf("FINISH\n");
}
return 0;
}
时间限制:3000 ms | 内存限制:65535 KB
难度:2
描述
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.
输入
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.
输出
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.
样例输入
3 123 321
3 123 312
样例输出
Yes.
in
in
in
out
out
out
FINISH
No.
FINISH
*/
#include<stdio.h>
#include<stack>
using namespace std;
int main()
{
int n,d[100];
char b[100],c[100];
while(scanf("%d %s %s",&n,b,c)!=EOF)
{
stack<char>t;
int i=0,j=0,k=0;
for(i=0;i<n;i++)
{
t.push(b[i]);
d[k]=1;
k++;
while(!t.empty()&&t.top()==c[j])
{
j++;
d[k]=0;
k++;
t.pop();
}
}
if(!t.empty())
printf("No.\n");
else
{
printf("Yes.\n");
for(i=0;i<k;i++)
if(d[i])
printf("in\n");
else
printf("out\n");
}
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
- ci框架ajax分页
- jQuery ajax - serialize() 方法
- vector
- 自定义导航转场动画以及更多
- firefox下jquery iframe刷新页面提示会导致重复之前动作
- HDU-1022 Train Problem I
- POJ 2458 Kindergarten( 最大独立集(图) & 完全子图 )
- 同一个定时器实现不同的定时功能
- 互联网生活有三大定律,摩尔定律、梅特卡夫定律和颠覆定律。
- CPU和GPU的区别
- 小编程题之A-Star算法的应用
- 九度OJ 题目1526:朋友圈(小米2013年校园招聘笔试题)
- 《高质量程序设计指南》---之使用const提高函数的健壮性
- 转]Window, Linux动态链接库的分析对比