HDU 1702 (栈和队列的模拟)
来源:互联网 发布:linux软件下载 编辑:程序博客网 时间:2024/06/17 15:42
ACboy needs your help again!
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5753 Accepted Submission(s): 3019
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
题意:按照题目所给的方式,FIFO模拟队列的先进先出,FILO模拟栈的先进后出。没有数时输出None;
#include<iostream>#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>#include<stdlib.h>#include<queue>#include<stack>typedef long long ll;using namespace std;int main(){ int t,n,m; char a[6],b[6]; scanf("%d",&t); while(t--) { scanf("%d %s",&n,a); if(a[2] == 'F') { queue<int>que; for(int i = 0 ; i < n ; i++) { scanf("%s",b); if(b[0] == 'I') { scanf("%d",&m); que.push(m); } else { if(que.empty()) { printf("None\n"); } else { printf("%d\n",que.front()); que.pop(); } } } } else { stack<int>st; for(int i = 0 ; i < n ; i++) { scanf("%s",b); if(b[0] == 'I') { scanf("%d",&m); st.push(m); } else { if(st.empty()) { printf("None\n"); } else { printf("%d\n",st.top()); st.pop(); } } } } }}
0 0
- HDU 1702 (栈和队列的模拟)
- HDU 1702 ACboy needs your help again! (模拟栈和队列)
- HDU 1702简单的栈和队列
- 队列模拟栈和栈模拟队列
- HDU ACM 4041 Eliminate Witches! 队列和栈模拟DFS
- 栈和队列的相互模拟
- 栈和队列的相互模拟
- (C++)栈和队列的模拟实现
- hdu 1702 ACboy needs your help again!(模拟栈和队列)
- hdu 1702 栈和队列
- HDU 1702 ACboy needs your help again!(模拟 队列 栈)
- hdu 1237 简单计算器(数组模拟栈,队列)
- HDU 1387 Team Queue 队列的模拟
- Python模拟栈 和 队列
- 数组模拟队列和栈
- 链表-模拟栈和队列
- LinkedList模拟栈和队列
- hdu 1702 栈和队列的简单应用
- 程序猿媳妇儿注意事项
- stm32通过SPI与adc124s021通信读取ad
- POJ 3311 Hie with the Pie(状态压缩DP)
- 13. Roman to Integer
- Ajax-serialize()方法
- HDU 1702 (栈和队列的模拟)
- Openstack Manila源码阅读笔记(一)manilaclient调用过程
- ubuntu安装cuda6.5
- 【家谱】项目开发总结
- QEMU和QEMU-KVM的关系
- leetcode 278 First Bad Version C++
- UVA-101 The Blocks Problem
- CodeForces 702A
- 维诺图(Voronoi Diagram)分析与实现