HDU-1702-ACboy needs your help again!
来源:互联网 发布:黑色星期五淘宝打折么 编辑:程序博客网 时间:2024/06/07 05:23
ACboy needs your help again!
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
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!
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.
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
44 FIFOIN 1IN 2OUTOUT4 FILOIN 1IN 2OUTOUT5 FIFOIN 1IN 2OUTOUTOUT5 FILOIN 1IN 2OUTIN 3OUT
Sample Output
122112None23
做的第一道栈和队列的题,还不熟练
#include<cstdio>#include<stack>#include<queue>using namespace std;int main(){int t,n,num;char a[5],b[5];scanf("%d",&t);while(t--){stack<int> st;queue<int> qu;scanf("%d %s",&n,&a);if(a[2]=='F'){for(int i=0;i<n;i++){scanf("%s",&b);if(b[0]=='I'){scanf("%d",&num);qu.push(num);}else{if(qu.empty())printf("None\n");else{printf("%d\n",qu.front());qu.pop();}}}}else{for(int i=0;i<n;i++){scanf("%s",&b);if(b[0]=='I'){scanf("%d",&num);st.push(num);}else{if(st.empty())printf("None\n");else{printf("%d\n",st.top());st.pop();}}}}}return 0;}
0 0
- HDU 1702 ACboy needs your help again!
- HDU 1702 ACboy needs your help again!
- hdu 1702 ACboy needs your help again!
- HDU-ACboy needs your help again!-1702
- 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!
- hdu---1702ACboy 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!
- 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!
- HDU - 1702 ACboy needs your help again!
- 操作文件File类方法
- 快速通道------陈锦松ITPUB博客
- c++设计模式之组合模式
- 小悟:PS快捷方式
- reactJS - 03利用babel来”编译”我们的脚本文件
- HDU-1702-ACboy needs your help again!
- Simplify Path
- LCA与RMQ算法
- C语言开始
- 数据库关系代数
- NDK使用 ,OpenCV库的调用,在NDK中使用纯C++代码,android studio 2.1(1)
- C语言七种关键字
- Failed to place enough replicas, still in need of 1 to reach 3. For more information。。。。
- 双指针(下标)的应用