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): 8559    Accepted Submission(s): 4289

Problem Description

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
  

 

Source

2007省赛集训队练习赛（1）

这里我借助STL里的栈和队列

FIFO 就是先进先出 

IN i是i进入队列

OUT 是输出队列的第一个并出队

FILO是先进后出 

IN i 是i进栈；

OUT 是输出栈顶元素并出栈；

#include<iostream>
#include<stack>
#include<string>
#include<queue>
using namespace std;
int main()
{
string a="FIFO",b="IN";
int t,n,l;
string c,w;
cin>>t;
while(t--)
{
cin>>n>>c;
if(c==a)
{queue<int>q;
   while(n--)
            {


                cin>>w;
if(w==b)
{
cin>>l;
q.push(l);
}
else
{
if(q.empty())
{
cout<<"None"<<endl;
}
else
{
cout<<q.front()<<endl;
q.pop();
}
}
            }




}
else
{
stack<int >s;
while(n--)
            {


                cin>>w;
if(w==b)
{
cin>>l;
s.push(l);
}
else
{
if(s.empty())
{
cout<<"None"<<endl;
}
else
{
cout<<s.top()<<endl;
s.pop();
}
}
            }


}
}
}

人一我百！人十我万！永不放弃~~~怀着自信的心，去追逐梦想。