HDU—1022Train Problem I

原创 2018年04月16日 22:26:11
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. 
  
InputThe 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. 
OutputThe 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


        
  
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.".
代码并没有通过,只能过部分案例,不知道为什么提交了总是runtime error,暂且记下了!!!!
#include<iostream>
#include<string>
#include<cstring>
#include<cstdlib>
#include<stack>
using namespace std;
char a[100100];
char b[100100];
int main()
{
    int n;
    string s;
    while(cin>>n)
    {
        s="";
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        int istrue=1;
        stack<int> q;
        while(!q.empty())
        {
            q.pop();
        }
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
        }
        for(int i=1;i<=n;i++)
        {
            cin>>b[i];
        }
        int na=1,nb=1;
        while(nb<=n)
        {
            if(a[na]==b[nb])
            {
                na++;
                nb++;
                s+="in\n";
                s+="out\n";
            }
            else if(!s.empty()&&q.top()==b[nb])
            {
                q.pop();
                nb++;
                s+="out\n";
            }
            else if(na<n)
            {
                q.push(a[na]);
                na++;
                s+="in\n";
            }
            else
            {
                istrue=0;
                break;
            }
        }
        if(istrue)
        {
            cout<<"Yes."<<endl;
            cout<<s<<endl;
        }
        else  cout<<"No."<<endl;
        cout<<"FINISH"<<endl;
    }
}

HDU 1022Train Problem I

链接:
  • u014474324
  • u014474324
  • 2014-04-14 21:27:06
  • 655

HDU 1022 Train Problem I 附详细思路

  • 2010年07月31日 14:33
  • 1KB
  • 下载

hdoj 1022Train Problem I

这道题有很多陷阱。Yes和No注意大小写。还有后面的.也要记住呦。还有还有一定要记住要清栈。...
  • qjt19950610
  • qjt19950610
  • 2015-08-02 21:11:37
  • 652

HDU 6242 Geometry Problem (随机数,几何)

Problem Description Alice is interesting in computation geometry problem recently. She found a inte...
  • zhao5502169
  • zhao5502169
  • 2017-11-12 14:28:25
  • 408

hdu-1022 Train Problem I

http://acm.hdu.edu.cn/showproblem.php?pid=1022 题意说在一个火车站只用一个铁轨可供停车,并且每次进入铁轨的车必须等后进来的车走之后才能开走,火车数量最多...
  • u012773338
  • u012773338
  • 2014-10-15 19:50:38
  • 614

hdu 1028整数划分

1、母函数 杭州电子科技大学课件 算法就是简单的模拟, (1+x+x^2+x^3+...)(1+x^2…+x^4+x^6+...)(1+x^3…+x^6+x^9+)...(...) =[1*(1+x...
  • pmt123456
  • pmt123456
  • 2016-10-10 13:12:26
  • 203

HDU - 2671(计算几何)

问题描述:  I'm sure this problem will fit you as long as you didn't sleep in your High School Math clas...
  • wust_cyl
  • wust_cyl
  • 2017-09-02 20:17:02
  • 121

HDU 1701 ACMer

Problem Description There are at least P% and at most Q% students of HDU are ACMers, now I want t...
  • jtjy568805874
  • jtjy568805874
  • 2015-04-29 20:44:46
  • 363

HDOJ题目1022Train Problem I(栈的模拟)

Train Problem I Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...
  • yu_ch_sh
  • yu_ch_sh
  • 2014-08-12 10:54:33
  • 307

hdu4347 The Closest M Points(kdtree+stl)

Problem Description The course of Software Design and Development Practice is objectionable. ZLC is...
  • wu_tongtong
  • wu_tongtong
  • 2017-08-30 15:01:24
  • 163
收藏助手
不良信息举报
您举报文章:HDU—1022Train Problem I
举报原因:
原因补充:

(最多只允许输入30个字)