题目
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
题意分析
输入一个总操作数,和一个指令
下面输入操作按操作输出结果
解题思路
FILO和FIFO可以分别用stack和queue来模拟就可以解决了。
IN的时候分为两种情况分别放入栈和队列中
OUT时同理。
注意:
别看错了栈空时输出的时None
AC代码
#include<bits/stdc++.h>
using namespace std;
char ich[4]="IN",pch[4]="OUT";
char str1[5]="FIFO",str2[5]="FILO";
stack<int>a;
queue<int>b;
int main()
{
int n;
cin>>n;
while(n--)
{
int m;
char str[10];
char ch[10];
cin>>m>>str;
//初始化
while(!a.empty()) a.pop();
while(!b.empty()) b.pop();
while(m--)
{
cin>>ch;
if(strstr(ch,ich))
{
int k;
cin>>k;
if(strstr(str,str1))
b.push(k);
else
a.push(k);
}
else
{
if(strstr(str,str1))
{
if(!b.empty())
{
cout<<b.front()<<endl;
b.pop();
}
else
cout<<"None"<<endl;
}
else
{
if(!a.empty())
{
cout<<a.top()<<endl;
a.pop();
}
else
cout<<"None"<<endl;
}
}
}
//初始化
while(!a.empty()) a.pop();
while(!b.empty()) b.pop();
}
return 0;
}