hdu 1702 ACboy needs your help again!(模拟栈和队列)
来源:互联网 发布:淘宝卖家怎样优化标题 编辑:程序博客网 时间:2024/04/28 23:03
ACboy needs your help again!
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4155 Accepted Submission(s): 2109
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!
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)
题目分析:
水题一枚,仅献上代码:
水题一枚,仅献上代码:
#include <iostream>#include <cstdio>#include <cstring>#include <queue>#include <stack>#include <algorithm>using namespace std;int t,n,num;char s[10];void FIFO ( ){ queue<int> q; for ( int i = 0 ; i < n ; i++ ) { scanf ( "%s" , s ); if ( s[0] == 'I' ) { scanf ( "%d" , &num ); q.push ( num ); } else { if ( q.empty() ) puts ( "None" ); else { printf ( "%d\n" , q.front() ); q.pop ( ); } } }}void FILO ( ){ stack<int> stk; for ( int i = 0 ; i < n ; i++ ) { scanf ( "%s" , s ); if ( s[0] == 'I' ) { scanf ( "%d" , &num ); stk.push ( num ); } else { if ( stk.empty() ) puts ( "None" ); else { printf ( "%d\n" , stk.top() ); stk.pop ( ); } } }}int main ( ){ scanf ( "%d" , &t ); while ( t-- ) { scanf ( "%d" , &n ); scanf ( "%s" , s ); if ( s[2] == 'F' ) FIFO ( ); else FILO( ); }}
0 0
- 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 1072 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!【栈和队列】
- 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!(栈和队列的试用)
- Android activity的启动模式
- Yahoo!团队:网站性能优化的35条黄金守则
- poj2965
- IOS开发语言Swift入门连载---初见
- PHP curl get post 提交函数
- hdu 1702 ACboy needs your help again!(模拟栈和队列)
- Lua源文件目录分析
- 嵌入式学习笔记004-裸奔篇之SDRAM
- tomcat配置数据库连接池
- javascript常用 正则表达式
- Git学习笔记(五)---修改管理
- 如何在本地搭建一个Android应用crashing跟踪系统-ACRA
- 推箱子
- jsp和css放置图片的路径问题