zoukankan      html  css  js  c++  java
  • Train Problem I

    Train Problem I

    Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)
    Total Submission(s) : 35   Accepted Submission(s) : 14

    Font: Times New Roman | Verdana | Georgia

    Font Size:  

    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
    

    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
     1 #include <stdio.h>
     2 #include <stdlib.h>
     3 #include <string.h>
     4 
     5 int main()
     6 {
     7     int NUM,Len,i,j,k,sign,Top;
     8     char str[10000],flat[10000],FLAT[10000],SIGN[10000];
     9     while(scanf("%d",&NUM)!=EOF)
    10     {
    11         memset(flat,0,sizeof(flat));
    12         memset(FLAT,0,sizeof(FLAT));
    13         memset(FLAT,0,sizeof(FLAT));
    14         getchar();
    15         scanf("%s%s",flat,FLAT);
    16             for(i=0,j=0,k=0,sign=0,Top=0;k<=NUM&&j<=NUM;)
    17             {
    18                 if(Top>=0&&k>0&&str[Top]==FLAT[j])
    19                 {
    20                     str[Top]='';
    21                     Top-=1;k-=1;j++;
    22                     if(Top==0&&j>=NUM)break;
    23                     SIGN[sign++]=1;
    24                 }
    25                 else
    26                     {str[k++]=flat[i++];Top=k-1;SIGN[sign++]=0;}
    27                 str[k]='';
    28             }
    29              str[k]='';
    30              if(str[0]=='')
    31             {
    32                 printf("Yes.
    ");
    33                 for(i=0;i<sign-2;i++)
    34                 if(SIGN[i]==0)
    35                     printf("in
    ");
    36                 else if(SIGN[i]==1)
    37                     printf("out
    ");
    38 
    39             }
    40              else
    41                 printf("No.
    ");
    42         printf("FINISH
    ");
    43     }
    44 
    45 
    46 
    47 }
    View Code
    转载请备注:
    **************************************
    * 作者: Wurq
    * 博客: https://www.cnblogs.com/Wurq/
    * Gitee: https://gitee.com/wurq
    **************************************
  • 相关阅读:
    在CentOS中配置DNS服务器
    CENTOS5.3 64位 VNC远程控制Centos 安装配置
    Windows Server 2003 FTP服务器配置详解 20091210 14:23:36| 分类: 服务器 | 标签: |字号大
    Centos 5.1 sendmail邮件服务器安装及配置
    DNS安装配置全过程
    tomcat多域名设置
    tomcat6 优化初步
    让CentOS自动备份mysql数据库 不指定
    开通企业邮箱之前,请登录您企业网站的域名注册服务商的域名管理平台,进行DNS配置及指向设置,谢谢您的配合
    18.3.2 在不同主机上使用 RMAN 备份建立物理备用数据库
  • 原文地址:https://www.cnblogs.com/Wurq/p/3750317.html
Copyright © 2011-2022 走看看