A - ACboy needs your help again!
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!
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!
The first line has one integer,represent the number oftest cases.
And the input of each subproblem are described above.
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
1 2 2 1 1 2 None 2 3
#include<stdio.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<string.h>
using namespace std;
void sta1(int n)
{
int a;
stack<int> o;
while(n--)
{
char num[6];
scanf("%s",num);
if(strcmp(num,"IN")==0)
{
scanf("%d",&a);
o.push(a);
}
if(strcmp(num,"OUT")==0)
{
if(o.empty())
printf("None\n");
else
{
printf("%d\n",o.top());
o.pop();
}
}
}
}
void que1(int n)
{
int a;
queue<int> o;
while(n--)
{
char num[6];
scanf("%s",num);
if(strcmp(num,"IN")==0)
{
scanf("%d",&a);
o.push(a);
}
if(strcmp(num,"OUT")==0)
{
if(o.empty())
printf("None\n");
else
{
printf("%d\n",o.front());
o.pop();
}
}
}
}
int main()
{
int n;scanf("%d",&n);
while(n--)
{
char num[100];
int a,b,i;
scanf("%d%s",&a,num);
if(strcmp(num,"FILO")==0)
sta1(a);
if(strcmp(num,"FIFO")==0)
que1(a);
}
return 0;
}