HDUOJ-1702 ACboy needs your help again!
来源:互联网 发布:软件评测师考试报名 编辑:程序博客网 时间:2024/06/11 09:01
ACboy needs your help again!
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6949 Accepted Submission(s): 3611
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!
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.
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
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
题意:有多组实例,根据FIFO或FILO来输出数字,若没有数字输出就输出None;
思路:根据栈和队列的特性可知FIFO为队列,FILO为栈;其实就是考察栈和队列的基本应用;
下面附上代码 :(自己写的,代码很长。。。QAQ)
#include<cstdio>#include<algorithm>#include<queue>#include<stack>#include<cstring>using namespace std;int main(){int t;scanf("%d",&t);while(t--){int a,b,l;char o[10];char m[10];queue<int> q;stack<int> s;memset(o,0,sizeof(o));scanf("%d%s",&a,m);if(!strcmp(m,"FIFO")){for(int i=0;i<a;i++){scanf("%s",o);if(!strcmp(o,"IN")){scanf("%d",&b);q.push(b); }else{if(!q.empty()){l=q.front();q.pop();printf("%d\n",l);}elseputs("None");}}}if(!strcmp(m,"FILO")){for(int i=0;i<a;i++){scanf("%s",o);if(!strcmp(o,"IN")){scanf("%d",&b);s.push(b); }else{if(!s.empty()){l=s.top();s.pop();printf("%d\n",l);}elseputs("None");}}}}return 0;}
0 0
- HDUOJ-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-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!
- HDOJ 1702 ACboy needs your help again!
- hdu---1702ACboy needs your help again!
- HDU - 1702 ACboy needs your help again!
- hdoj 1702 ACboy needs your help again!
- HDOJ 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!
- ACboy needs your help again!(1702)
- linux虚拟网桥
- Web architecture stack
- sql INNER JOIN 取得两个表中存在连接匹配关系的记录(mysql)
- Raspberry从零开始玩
- ConcurrentHashMap原理分析
- HDUOJ-1702 ACboy needs your help again!
- 服务器为什么用linux而非windows
- verilog文件系统函数调用
- 巧用RAND()提取随机行
- React Native之Picker组件详解
- 如何让字典保持有序
- 前端面试题
- libevent:一个在网络服务器中事件驱动开发库
- RMySQL函数使用