HDU:1702 ACboy needs your help again!(简单栈、队列)
来源:互联网 发布:淘宝自动上架软件 编辑:程序博客网 时间:2024/06/07 18:43
ACboy needs your help again!
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5669 Accepted Submission(s): 2962
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)
Recommend
lcy
题目大意:给你数据的方式,队列或栈,IN入栈或入队,OUT输出top或front。
解题思路:直接STL写。
代码如下:
#include <cstdio>#include <cstring>#include <queue>#include <stack>using namespace std;int main(){int t;int order;char lei[10];char CMD[5];scanf("%d",&t);for(int j=0;j<t;j++){scanf("%d %s",&order,lei);if(lei[2]=='F'){queue<int>que;int shu;for(int i=0;i<order;i++){scanf("%s",CMD);if(CMD[0]=='I'){scanf("%d",&shu);que.push(shu);}else{if(!que.empty()){printf("%d\n",que.front());que.pop();}else{printf("None\n");}}}while(!que.empty()){que.pop();}}else{stack<int>zhan;int shu;for(int i=0;i<order;i++){memset(lei,0,sizeof(CMD));getchar();scanf("%s",CMD);if(CMD[0]=='I'){scanf("%d",&shu);zhan.push(shu);}else{if(!zhan.empty()){printf("%d\n",zhan.top());zhan.pop();}else{printf("None\n");}}}while(!zhan.empty()){zhan.pop();}}}return 0;}
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 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 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!
- hdoj1873看病要排队(优先队列)
- gitlab 邮件配置(smtp)
- C#读取,修改并保存html文件——实例
- android 广告轮播位Banner轮播位 使用超级方便
- netty对http协议解析原理解析
- HDU:1702 ACboy needs your help again!(简单栈、队列)
- HDU1163 Eddy's digital Roots
- LeetCode1-Two Sum
- python的学习笔记
- 漫话中国古代史 —— 总论
- POJ 2082 Terrible Sets(单调栈)
- google gtest 快速入门
- poj 3320 Jessica's Reading Problem
- unity3d 第十四天