栈和队列

ACboy was kidnapped!! 
he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(. 
As a smart ACMer, you want to get ACboy out of the monster's labyrinth.But when you arrive at the gate of the maze, the monste say :" I have heard that you are very clever, but if can't solve my problems, you will die with ACboy." 
The problems of the monster is shown on the wall: 
Each problem's first line is a integer N(the number of commands), and a word "FIFO" or "FILO".(you are very happy because you know "FIFO" stands for "First In First Out", and "FILO" means "First In Last Out"). 
and the following N lines, each line is "IN M" or "OUT", (M represent a integer). 
and the answer of a problem is a passowrd of a door, so if you want to rescue ACboy, answer the problem carefully!

InputThe input contains multiple test cases. 
The first line has one integer,represent the number oftest cases. 
And the input of each subproblem are described above.OutputFor each command "OUT", you should output a integer depend on the word is "FIFO" or "FILO", or a word "None" if you don't have any integer.Sample Input

4
4 FIFO
IN 1
IN 2
OUT
OUT
4 FILO
IN 1
IN 2
OUT
OUT
5 FIFO
IN 1
IN 2
OUT
OUT
OUT
5 FILO
IN 1
IN 2
OUT
IN 3
OUT

Sample Output

1
2
2
1
1
2
None
2
3
模拟

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cstring>
#include <stdio.h>
#define lowbit(x) x&(-x)
#include <queue>
#include  <stack>
using namespace std;
const int maxn=5e5+10;
typedef long long ll;

char a[5];
int x;
void solve1(){

}

int main(){
    ios::sync_with_stdio(0);
    int n,m;
    while(~scanf("%d",&n)){
        while(n--){
            scanf("%d %s",&m,a);
            if(a[2]=='F'){
                queue<int>q;
                while(m--){
                    scanf("%s",a);
                    if(a[0]=='I'){
                        int ans=0;
                        scanf("%d",&ans);
                        q.push(ans);
                    }else{
                    if(q.empty())
                        printf("None\n");
                    else{
                        printf("%d\n",q.front());
                        q.pop();
                    }
                }
            }
        }else{
        stack<int>s;
        while(m--){
          scanf("%s",a);
          if(a[0]=='I'){
            int ans=0;
            scanf("%d",&ans);
            s.push(ans);
            }else{
            if(s.empty()){
                printf("None\n");
                }else{
                printf("%d\n",s.top());
                s.pop();
                }
            }
          }
        }
      }
   }
    return 0;
}

Train Problem I

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

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

 

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cstring>
#include <stdio.h>
#include <stack>
#define lowbit(x) x&(-x)

using namespace std;
const int maxn=5e5+10;
typedef long long ll;

char s1[100];
char s2[100];
int ans[100];
int main(){
    ios::sync_with_stdio(0);
    int n;
    while(~scanf("%d %s %s",&n, s1,s2)){
        int j=0,k=0;
        stack<int>s;
        while(!s.empty())
            s.pop();
        memset(ans,-1,sizeof(ans));
        for(int i=0;i<n;i++){
            s.push(s1[i]);
            ans[k++]=1;
            while(!s.empty()&&s.top()==s2[j]){
                ans[k++]=0;
                s.pop();
                j++;
            }
        }
        if(j==n){
            printf("Yes.\n");
            for(int i=0;i<k;i++){
                if(ans[i])
                    printf("in\n");
                else
                    printf("out\n");
            }
        }else{
        printf("No.\n");
        }
    printf("FINISH\n");
    }
    return 0;
}