hdu-1702-ACboy needs your help again!
来源:互联网 发布:mysql 查询替换字符串 编辑:程序博客网 时间:2024/05/16 02:08
ACboy needs your help again!
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8988 Accepted Submission(s): 4486
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
44 FIFOIN 1IN 2OUTOUT4 FILOIN 1IN 2OUTOUT5 FIFOIN 1IN 2OUTOUTOUT5 FILOIN 1IN 2OUTIN 3OUT
Sample Output
122112None23
题意:
FIFO 先进先出 FILO 先进后出 IN 进 OUT 出 输出正确序列 若没有数可以出则输出None
思路:无
code
#include<iostream>#include<cstdio>#include<cstring>#include<queue>#include<stack>using namespace std;int main(){ int n,m; string str1,str2; scanf("%d",&n); while(n--){ cin>>m>>str1; //cout<<str1<<endl; if(str1=="FIFO"){ queue<int>Q; while(m--){ int a; cin>>str2; if(str2=="IN"){ cin>>a; Q.push(a); } else { if(Q.empty()) cout<<"None"<<endl; else { a=Q.front(); Q.pop(); cout<<a<<endl; } } } }else if(str1=="FILO"){ stack<int> Q; while(m--){ int a; cin>>str2; if(str2=="IN"){ cin>>a; Q.push(a); } else { if(Q.empty()) cout<<"None"<<endl; else { a=Q.top(); Q.pop(); cout<<a<<endl; } } } } } return 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!
- 汇编JCC笔记
- 打印杨辉三角
- 链表中元素的增加与删减
- 深入了解 Java 之虚拟机内存
- vmvare下 centos重启后网络无连接
- hdu-1702-ACboy needs your help again!
- 有限状态机实现-状态机介绍
- Educational Codeforces Round 32 G. Xor-MST
- 欢迎使用CSDN-markdown编辑器
- 今夕何夕
- 解析c++中函数重载的实现原理
- git权威指南总结五:git克隆
- 毛驴之死”献给辛勤加班的程序猿
- 农业政策学学习笔记