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): 5502    Accepted Submission(s): 2866

[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<stdio.h>
#include<string.h>
#include<queue>
#include<stack>
using namespace std;
void que(int n)
{
int a,b;
char str[5];
queue<int>q;
while(n--)
{
scanf("%s",str);
if(strcmp(str,"IN")==0)
{
scanf("%d",&a);
q.push(a); //入队列
}
else
{
if(q.empty())
printf("None\n");
else
{
b=q.front();//取队首元素
printf("%d\n",b);
q.pop();//删除队首元素；
}
}
}
while(!q.empty())
{
q.pop();
}
}
void sta(int n)
{
int a,b;
char str[5];
stack<int>s;
while(n--)
{
scanf("%s",str);
if(strcmp(str,"IN")==0)
{
scanf("%d",&a);
s.push(a);//入栈
}
else
{
if(s.empty())
printf("None\n");
else
{
b=s.top();//返回栈顶元素的值；
printf("%d\n",b);
s.pop();//删除栈顶元素；
}
}
}
while(!s.empty())
{
s.pop();
}
}
int main()
{
int t,n;
char str1[5];
scanf("%d",&t);
while(t--)
{
scanf("%d %s",&n,str1);
if(!strcmp(str1,"FIFO"))
{
que(n);
}
else
{
sta(n);
}
}
return 0;
}