ACboy needs your help again!————栈和队列(水题)

╰+哭是因爲堅強的太久メ 2022-05-18 02:59 140阅读 0赞

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!  
**Input**  
The 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.  
**Output**  
For 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<cstdio>
    #include<cstring>
    #include<queue>
    #include<vector>
    #include<stack>
    #include<algorithm>
    using namespace std;
    
    int main() 
    {
        int t;
        scanf("%d",&t);
        while(t--)
        {
            char str[10]; 
            int n;
            queue<int> q;
            stack<int> s;
            scanf("%d %s",&n,str);
            if(str[2]=='F')
                for(int i=0;i<n;i++)
                {
                    char str2[10];
                    scanf("%s",str2);
                    if(str2[0]=='I')
                    {
                        int x;
                        scanf("%d",&x);
                        q.push(x);
                    }
                    else
                    {
                        if(q.size())
                        {
                            printf("%d\n",q.front());
                            q.pop();
                        }
                        else
                            printf("None\n");
                    }
                 } 
            else
                for(int i=0;i<n;i++)
                {
                    char str2[10];
                    scanf("%s",str2);
                    if(str2[0]=='I')
                    {
                        int x;
                        scanf("%d",&x);
                        s.push(x);
                    }
                    else
                    {
                        if(s.size())
                        {
                            printf("%d\n",s.top());
                            s.pop();
                        }
                        else
                            printf("None\n");
                    }
                 } 
    
        }
        return 0;
    }