A - ACboy needs your help again!
2017-07-25 20:26
330 查看
点击打开链接
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!
InputThe 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.
OutputFor 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
Sample Output
题解:栈和队列的简单应用
#include<cstdio>
#include<cstring>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main()
{
int n;
char a[6],b[6];
stack<int> stk;
queue<int> q;
while(scanf("%d",&n)!=EOF)
{
while(n--)
{
int num,dat;
scanf("%d %s",&num,a);
if(strcmp(a,"FIFO")==0)
{
for(int i=0;i<num;i++)
{
scanf("%s",b);
if(strcmp(b,"IN")==0){
scanf("%d",&dat);
q.push(dat);
} else{
if(q.empty())
printf("None\n");
else {
printf("%d\n",q.front());
q.pop();
}
}
}
}
else
{
for(int i=0;i<num;i++)
{
scanf("%s",b);
if(strcmp(b,"IN")==0){
scanf("%d",&dat);
stk.push(dat);
} else{
if(stk.empty())
printf("None\n");
else {
printf("%d\n",stk.top());
stk.pop();
}
}
}
}
while(!q.empty()){
q.pop();
}
while(!stk.empty())
{
stk.pop();
}
}
}
return 0;
}
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!
InputThe 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.
OutputFor 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
题解:栈和队列的简单应用
#include<cstdio>
#include<cstring>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main()
{
int n;
char a[6],b[6];
stack<int> stk;
queue<int> q;
while(scanf("%d",&n)!=EOF)
{
while(n--)
{
int num,dat;
scanf("%d %s",&num,a);
if(strcmp(a,"FIFO")==0)
{
for(int i=0;i<num;i++)
{
scanf("%s",b);
if(strcmp(b,"IN")==0){
scanf("%d",&dat);
q.push(dat);
} else{
if(q.empty())
printf("None\n");
else {
printf("%d\n",q.front());
q.pop();
}
}
}
}
else
{
for(int i=0;i<num;i++)
{
scanf("%s",b);
if(strcmp(b,"IN")==0){
scanf("%d",&dat);
stk.push(dat);
} else{
if(stk.empty())
printf("None\n");
else {
printf("%d\n",stk.top());
stk.pop();
}
}
}
}
while(!q.empty()){
q.pop();
}
while(!stk.empty())
{
stk.pop();
}
}
}
return 0;
}
相关文章推荐
- hdu 1702 ACboy needs your help again!
- ACboy needs your help again!(1702)
- C - ACboy needs your help again!
- A - ACboy needs your help again!
- HDU 1702 ACboy needs your help again!(模拟 队列 栈)
- HDU-1702 ACboy needs your help again!【栈与队列】
- HDOJ-1702 ACboy needs your help again!
- HDU 1702 ACboy needs your help again! (栈和队列的模拟)
- 【杭电oj1702】ACboy needs your help again!
- HDU1702 ACboy needs your help again!(队列和栈)
- A - ACboy needs your help again!
- 【HDU】1702---ACboy needs your help again!(栈&&队列)
- 【杭电】[1702]ACboy needs your help again!
- 杭电ACboy needs your help again!
- HDU - 1702 ACboy needs your help again!
- hdu 1702 ACboy needs your help again!(模拟栈和队列)
- HDU 1702 ACboy needs your help again!(模拟两种数据结构)
- hdu 1702 :ACboy needs your help again!(练习使用双端队列)
- 【HOU 1702】ACboy needs your help again!(栈和队列-水题)
- hdoj 1702 ACboy needs your help again!