HDU 1702 ACboy needs your help again!
2016-12-05 21:14
435 查看
ACboy needs your help again!
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6332 Accepted Submission(s): 3311
[align=left]Problem Description[/align]
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!
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
1
2
2
1
1
2
None
2
3
#include<cstdio> #include<cstring> #include<stack> #include<queue> #include<algorithm> using namespace std; int main(){ int n; char sn[5]; char st[4]; scanf("%d",&n); while (n--){ int t,pt; stack<int> s; queue<int> q; scanf("%d %s",&t,sn); if (!strcmp(sn,"FILO")){ for (int i=0;i<t;++i){ scanf("%s",st); if (!strcmp(st,"IN")){ scanf("%d",&pt); s.push(pt); } if (!strcmp(st,"OUT")){ if (s.empty()) puts("None"); else { printf("%d\n",s.top()); s.pop(); } } } } if (!strcmp(sn,"FIFO")){ for (int i=0;i<t;++i){ scanf("%s",st); if (!strcmp(st,"IN")){ scanf("%d",&pt); q.push(pt); } if (!strcmp(st,"OUT")){ if (q.empty()) puts("None"); else{ printf("%d\n",q.front()); q.pop(); } } } } } return 0; }
相关文章推荐
- HDU 1702--ACboy needs your help again!【STL】
- HDU1702 acm 数据结构 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!(模拟 队列 栈)
- HDU1702 ACboy needs your help again!
- ACboy needs your help again! hdu1702
- 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!