hdoj1702ACboy needs your help again!
2016-07-25 21:03
337 查看
[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<algorithm>
#include<stack>
#include<queue>
using namespace std;
int main()
{
int n;
char str1[20],str2[10];
scanf("%d",&n);
while(n--)
{
queue<int>que;
stack<int>st;
int m,x;
scanf("%d %s",&m,str1);
if(strcmp(str1,"FIFO")==0)
{
while(m--)
{
scanf("%s",str2);
if(strcmp(str2,"IN")==0)
{
scanf("%d",&x);
que.push(x);
}
else if(strcmp(str2,"OUT")==0)
{
if(!que.empty())
{
printf("%d\n",que.front());
que.pop();
}
else
printf("None\n");
}
}
}
if(strcmp(str1,"FILO")==0)
{
while(m--)
{
scanf("%s",str2);
if(strcmp(str2,"IN")==0)
{
scanf("%d",&x);
st.push(x);
}
else if(strcmp(str2,"OUT")==0)
{
if(!st.empty())
{
printf("%d\n",st.top());
st.pop();
}
else
printf("None\n");
}
}
}
}
}
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<algorithm>
#include<stack>
#include<queue>
using namespace std;
int main()
{
int n;
char str1[20],str2[10];
scanf("%d",&n);
while(n--)
{
queue<int>que;
stack<int>st;
int m,x;
scanf("%d %s",&m,str1);
if(strcmp(str1,"FIFO")==0)
{
while(m--)
{
scanf("%s",str2);
if(strcmp(str2,"IN")==0)
{
scanf("%d",&x);
que.push(x);
}
else if(strcmp(str2,"OUT")==0)
{
if(!que.empty())
{
printf("%d\n",que.front());
que.pop();
}
else
printf("None\n");
}
}
}
if(strcmp(str1,"FILO")==0)
{
while(m--)
{
scanf("%s",str2);
if(strcmp(str2,"IN")==0)
{
scanf("%d",&x);
st.push(x);
}
else if(strcmp(str2,"OUT")==0)
{
if(!st.empty())
{
printf("%d\n",st.top());
st.pop();
}
else
printf("None\n");
}
}
}
}
}
相关文章推荐
- poj 1363 Rails (栈的应用+STL)
- Naive Bayes - spark.mllib的实现
- POJ 1363 Rails
- hdu杭电1702 ACboy needs your help again!【栈和队列】
- POJ-1363-Rails
- poj 1363 Rails
- POJ-1363 Rails(栈应用)
- Failed to place enough replicas, still in need of 1 to reach 3. For more information。。。。
- HDU-1702-ACboy needs your help again!
- 概率机器学习和人工智能(概率机器学习和人工intelligence_Nature2015)
- hdu 5046 Airport 二分+重复覆盖
- Thread.Sleep(1000) 、Task.Delay(1000).Wait() 区别
- Password authentication failed, Please verify that the username and password are correct
- 杭电hdOJ1982 Kaitou Kid - The Phantom Thief (1)
- Rails poj 1363
- python - PipeMapRed.waitOutputThreads(): subprocess failed with code 1
- 【POJ】[1995]Raising Modulo Numbers
- hdoj1702ACboy needs your help again!(栈和队列基础题)
- hd 1702 ACboy needs your help again!
- 隐马尔科夫模型(HMMs)之五:维特比算法及前向后向算法