HDOJ 1702 ACboy needs your help again!

ACboy needs your help again!

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 5720    Accepted Submission(s): 2996

[align=left]Problem Description[/align]
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!
 

[align=left]Input[/align]
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.
 

[align=left]Output[/align]
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.
 

[align=left]Sample Input[/align]

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

 

[align=left]Sample Output[/align]

1
2
2
1
1
2
None
2
3

 
刚接触栈和队列，还不会写，一边查一边写的，磕磕绊绊的。程序猿真口怕（其实就是简单地栈和队列的基本操作）

#include<cstdio>
#include<stack>
#include<queue>
using namespace std;
int main()
{
char str[12];
int n,m,t;
scanf("%d",&n);
while(n--)
{
scanf("%d%s",&t,str);
if(str[2]=='F')
{
queue<int>Que;
while(t--)
{
scanf("%s",str);
if(str[0]=='I')
{
scanf("%d",&m);
Que.push(m);
}
else if(!Que.empty())
{
printf("%d\n",Que.front());
Que.pop();
}
else
printf("None\n");
}
}
else
{
stack<int>Sta;
while(t--)
{
scanf("%s",str);
if(str[0]=='I')
{
scanf("%d",&m);
Sta.push(m);
}
else if(!Sta.empty())
{
printf("%d\n",Sta.top());
Sta.pop();
}
else
printf("None\n");
}
}
}
return 0;
}