XYNUOJ ACboy needs your help
来源:互联网 发布:sql统计总金额 编辑:程序博客网 时间:2024/05/21 10:24
问题 E: ACboy needs your help again!
时间限制: 1 Sec 内存限制: 30 MB提交: 38 解决: 23
[提交][状态][讨论版]
题目描述
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!
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!
输入
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.
The first line has one integer,represent the number oftest cases.
And the input of each subproblem are described above.
输出
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.
样例输入
24 FIFOIN 1IN 2OUTOUT4 FILOIN 1IN 2OUTOUT
样例输出
1221
#include<stdio.h>
#include<queue>
#include<stack>
#include<iostream>
using
namespace
std;
queue<
int
> q;
stack<
int
> s;
int
n;
void
Queue()
{
int
num;
char
str[20];
while
(n--)
{
scanf
(
"%s"
, str);
if
(str[0] ==
'I'
)
{
scanf
(
"%d"
, &num);
q.push(num);
}
else
if
(str[0] ==
'O'
&& !q.empty())
{
printf
(
"%d\n"
, q.front());
q.pop();
}
else
{
printf
(
"None\n"
);
}
}
}
void
Stack()
{
int
num;
char
str[20];
while
(n--)
{
scanf
(
"%s"
, str);
if
(str[0] ==
'I'
)
{
scanf
(
"%d"
, &num);
s.push(num);
}
else
if
(str[0] ==
'O'
&& !s.empty())
{
printf
(
"%d\n"
, s.top());
s.pop();
}
else
{
printf
(
"None\n"
);
}
}
}
int
main()
{
int
t;
char
str[10];
scanf
(
"%d"
, &t);
while
(t--)
{
while
(!q.empty())
{
q.pop();
}
while
(!s.empty())
{
s.pop();
}
scanf
(
"%d %s"
, &n, str);
if
(str[2] ==
'F'
)
Queue();
else
Stack();
}
return
0;
}
阅读全文
1 0
- XYNUOJ ACboy needs your help
- ACboy needs your help
- ACboy needs your help
- ACboy needs your help
- hdu acboy needs your help
- hdu1712 ACboy needs your help
- hdu1712 ACboy needs your help
- ACboy needs your help again!
- hdu1712 ACboy needs your help
- ACboy needs your help(DP)
- hdu1712 ACboy needs your help
- ACboy needs your help again!
- Acboy needs your help again!
- 【HDU1712】【ACboy needs your help】
- ACboy needs your help again!
- HDU1712 ACboy needs your help
- ACboy needs your help again!
- ACboy needs your help again!
- 【HPU 1414: Kick Ass】
- Java基础22
- 噩梦多校6。。HDU6103 Kirinriki(字符串,尺取法)
- 黑马搜索_下拉框提示
- MySQL入门3——约束及修改数据表
- XYNUOJ ACboy needs your help
- 哈理工OJ 1494 网络(割点)
- Path Sum II
- JVM(2)架构
- jbpm框架活动标志
- HDU-6057 Kanade's convolution(多项式FWT)
- 13.1.1 析构函数
- 判断给定森林中有多少棵树特别版(类似于邻接表)
- 51nod 1082 与7无关的数