題干：

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

解題報(bào)告：

? ? ? ?按照題意模擬棧和隊(duì)列就可以了。

AC代碼：

#include<bits/stdc++.h>using namespace std;int main() {int t,tmp;cin>>t;char op[15];while(t--) {int m;scanf("%d",&m);scanf("%s",op);if(!strcmp(op,"FIFO")) {queue<int > q;while(m--) {scanf("%s",op);if(op[0] == 'I') {scanf("%d",&tmp);q.push(tmp);}else {if(q.empty()) printf("None\n");else {printf("%d\n",q.front());q.pop();}}}}else {stack<int > sk;while(m--) {scanf("%s",op);if(op[0] == 'I') {scanf("%d",&tmp);sk.push(tmp);}else {if(sk.empty()) printf("None\n");else {printf("%d\n",sk.top());sk.pop();}}}}}return 0 ; }

?

總結(jié)

以上是生活随笔為你收集整理的【HDU - 1702 】ACboy needs your help again! （栈和队列，水题模拟）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。