码迷,mamicode.com
首页 > 其他好文 > 详细

HDU 1702 ACboy needs your help again! (栈和队列的模拟)

时间:2014-08-06 01:52:40      阅读:209      评论:0      收藏:0      [点我收藏+]

标签:des   style   blog   http   color   java   os   io   

ACboy needs your help again!

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3164    Accepted Submission(s): 1655


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!
 

 

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
 

 

Source
 

 

Recommend
lcy
 

 就是对栈和队列的模拟,栈是FILO队列是FIFO

bubuko.com,布布扣
 1 #include<iostream>
 2 #include<cstdio>
 3 #include<queue>
 4 #include<stack>
 5 #include<string>
 6 using namespace std;
 7 int main()
 8 {
 9     int kase,n,num;
10     string s,str;
11     cin>>kase;
12     while(kase--)
13     {
14         cin>>n>>s;
15         if(s=="FIFO")
16         {
17             queue<int> Q;
18             while(n--)
19             {
20                 cin>>str;
21                 if(str=="IN")
22                 {
23                     cin>>num;
24                     Q.push(num);
25                 }
26                 if(str=="OUT")
27                 {
28                     if(Q.empty())
29                         printf("None\n");
30                     else
31                     {
32                         printf("%d\n",Q.front());
33                         Q.pop();
34                     }
35                 }
36             }
37         }
38         if(s=="FILO")
39         {
40             stack<int> S;
41             while(n--)
42             {
43                 cin>>str;
44                 if(str=="IN")
45                 {
46                     cin>>num;
47                     S.push(num);
48                 }
49                 if(str=="OUT")
50                 {
51                     if(S.empty())
52                         printf("None\n");
53                     else
54                     {
55                         printf("%d\n",S.top());
56                         S.pop();
57                     }
58                 }
59             }
60         }
61     }
62     return 0;
63 }
View Code

 

HDU 1702 ACboy needs your help again! (栈和队列的模拟),布布扣,bubuko.com

HDU 1702 ACboy needs your help again! (栈和队列的模拟)

标签:des   style   blog   http   color   java   os   io   

原文地址:http://www.cnblogs.com/clliff/p/3893544.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!