ACboy needs your help again! (栈、队列 模拟)
来源:互联网 发布:php exec 返回1 编辑:程序博客网 时间:2024/05/20 13:07
ACboy needs your help again!
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 100 Accepted Submission(s): 80Problem 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
Source
2007省赛集训队练习赛(1)
Recommend
lcy
简单的栈与队列的模拟
//freopen("/Users/zhangzhichao/Documents/HDOJ/HDOJ/1.txt", "r", stdin);#include <stdio.h>#include <iostream>#include <algorithm>#include <cmath>#include <string>#include <vector>#include <string.h>#include <memory>#include <queue>#include <stack>using namespace std;int main () { //freopen("/Users/zhangzhichao/Documents/HDOJ/HDOJ/1.txt", "r", stdin); char str[10]; queue<int> que; stack<int> sta; int t; cin >> t; while (t--) { while (!que.empty()) { que.pop(); } while (!sta.empty()) { sta.pop(); } int n; cin >> n >> str; if (str[2] == 'L') { int value; for (int i = 0; i < n; ++i) { cin >> str; if (str[0] == 'I') { cin >> value; sta.push(value); } else { if (!sta.empty()) { cout << sta.top() << endl; sta.pop(); } else { cout << "None" << endl; } } } } else { int value; for (int i = 0; i < n; ++i) { cin >> str; if (str[0] == 'I') { cin >> value; que.push(value); } else { if (!que.empty()) { cout << que.front() << endl; que.pop(); } else { cout << "None" << endl; } } } } }}
0 0
- 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!(栈和队列)
- 【HDU】1702---ACboy needs your help again!(栈&&队列)
- HDU 1702 ACboy needs your help again! (模拟栈和队列)
- ACboy needs your help again!(栈与队列)
- HDU 1072 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! 队列&&栈的应用
- 杭电-1702 ACboy needs your help again!(栈&队列)
- hdu1702 ACboy needs your help again!(栈和队列
- HDU 1702 ACboy needs your help again! (栈与队列)
- HDU-1702 ACboy needs your help again! 栈和队列
- ACboy needs your help again!(栈和队列)
- ACboy needs your help again! 队列和栈的应用
- Leetcode-Longest Palindromic Substring
- C#操作电脑定时关机
- javaScript数据类型和变量需要注意的几个细节
- List使用sort进行排序
- CentOs7用phpize安装mcrypt扩展时遇到错误
- ACboy needs your help again! (栈、队列 模拟)
- 一、我的Python之路 -- 初识
- 阻止445端口连接
- acm杭电HDU2177取(2堆)石子游戏(威佐夫博弈)
- Android Crash处理流程分析
- 网页抓取手机号
- spring,freemarker,异步发邮件
- 在MyEclipse中启动项目正常,但不能访问Tomcat默认主页解决办法
- powershell使用心得