hdu1702 ACboy needs your help again!

最新推荐文章于 2023-08-22 18:52:19 发布

原创最新推荐文章于 2023-08-22 18:52:19 发布 · 156 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#队列 #java #stack #栈 #queue

这篇博客介绍了一种模拟栈和队列数据结构操作的方法，用于解决一个关于ACboy被怪物困住的问题。怪物提出了基于FIFO（先进先出）和FILO（先进后出）原则的一系列命令，需要通过输入和输出操作来解答。文章通过C++代码展示了如何处理这些命令，以求得正确的答案来解救ACboy。

ACboy needs your help again!

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

Problem Description(模拟栈和队列，栈是FILO,队列是FIFO)

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 FIFO

IN 1

IN 2

OUT

4 FILO

IN 1

IN 2

OUT

5 FIFO

IN 1

IN 2

OUT

5 FILO

IN 1

IN 2

OUT

IN 3

OUT

Sample Output

None

#include <iostream>
#include <stack>
#include <vector>
#include <string>
#include <queue>
#include <cmath>

using namespace std;

int main()
{
   cin.sync_with_stdio(false);
   cin.tie(nullptr);
   int t,n,tmp;
   cin>>t;
   while (t--)
   {
       string s1,s2;
       stack<int> S;
       queue<int> Q;
       cin>>n>>s1;
       for(int i=0;i<n;i++){
           if(s1=="FIFO")//队列
           {
               cin>>s2;
               if(s2=="IN")
               {
                   cin>>tmp;
                   Q.push(tmp);
               }
               if(s2=="OUT"){
                   if(Q.empty()){
                       cout<<"None"<<endl;
                   }else{
                       cout<<Q.front()<<endl;
                       Q.pop();
                   }
               }
           }else{//栈
                cin>>s2;
               if(s2=="IN")
               {
                   cin>>tmp;
                   S.push(tmp);
               }
               if(s2=="OUT"){
                   if(S.empty()){
                       cout<<"None"<<endl;
                   }else{
                       cout<<S.top()<<endl;
                       S.pop();
                   }
               }             
           }
       }
   }
   return 0;
}