hdoj 1702 ACboy needs your help again!
来源:互联网 发布:危重孕产妇网络直报 编辑:程序博客网 时间:2024/06/13 16:36
ACboy needs your help again!
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3953 Accepted Submission(s): 1996
Problem 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
STL 栈和队列练习。
#include<stdio.h>#include<string.h>#include<stack>#include<queue>using namespace std;void que(int n){ int a,b; char str[5]; queue<int>q; while(n--) { scanf("%s",str); if(!strcmp(str,"IN")) { scanf("%d",&a); q.push(a);//入 } else { if(q.empty())//队列为空 返回true printf("None\n"); else { b=q.front(); printf("%d\n",b); q.pop(); } } } while(!q.empty()) { q.pop(); }}void sta(int n){ int a,b; char str[5]; stack<int>s;//栈 while(n--) { scanf("%s",str); if(!strcmp(str,"IN")) { scanf("%d",&a); s.push(a);//入 } else { if(s.empty())//栈为空 返回true printf("None\n"); else { b=s.top(); printf("%d\n",b); s.pop(); } } } while(!s.empty()) { s.pop(); }}int main(){ int t,n,i,j; char s1[6]; scanf("%d",&t); while(t--) { scanf("%d %s",&n,s1); if(!strcmp(s1,"FIFO"))//队列 { que(n); } else { sta(n); } } return 0;}
0 0
- HDOJ 1702 ACboy needs your help again!
- hdoj 1702 ACboy needs your help again!
- HDOJ 1702 ACboy needs your help again!
- hdoj 1702 ACboy needs your help again!
- hdoj-1702-ACboy needs your help again!
- HDOJ 1702 ACboy needs your help again!
- HDOJ-1702 ACboy needs your help again!
- HDOJ 1702 ACboy needs your help again!
- HDOJ-1702 ACboy needs your help again!
- HDOJ 1702 ACboy needs your help again! (stack & queue)
- 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!
- 【c语言】写一个函数返回参数值为1的个数(优化)
- 3.RFID系统及其功能
- Unity3d 人物换装 之 Mesh 合并 (材质合并)
- 从源码分析PHP的SESSION实现机制
- 基数排序优化
- hdoj 1702 ACboy needs your help again!
- 香港机房
- Transform变换
- Reverse Integer
- sqlmap安装
- iOS边城之绘图编程(Core Graghics)
- 欧拉项目第15题
- 老码识途 汇编分析函数调用和局部变量
- 自己编写字符串复制函数