1702.ACboy needs your help again!(队列&&栈-CSDN博客

本文链接：https://blog.csdn.net/qq_46622890/article/details/118734252

这篇博客讲述了如何利用FIFO（先进先出）和FILO（先进后出）原理解决怪物设置的谜题，以拯救被绑架的AC boy。博主通过分析输入的命令，使用队列和栈的数据结构来模拟问题，并给出了对应的C++代码实现。在每个案例中，根据输入的‘IN’和‘OUT’指令，博主展示了如何正确地输出答案或提示'None'。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

#include<cstdio>
#include<string>
#include<iostream>
#include<stack>
#include<queue>
using namespace std;

void fifo(int num)
{
    string io;int t;
    queue<int>Q;
    while(num--)
    {
        cin>>io;
        if(io.compare("IN")==0)
        {
            cin>>t;
            Q.push(t);
        }
        else
        {
            if(Q.empty())
                cout<<"None\n";
            else
            {
                cout<<Q.front()<<endl;
                Q.pop();
            }
        }
    }
}

void filo(int num)
{
    stack<int>Q;
    while(num--)
    {
        string io;int t;
        cin>>io;
        if(io.compare("IN")==0)
        {
            cin>>t;
            Q.push(t);
        }
        else
        {
            if(Q.empty())
                cout<<"None\n";
            else
            {
                cout<<Q.top()<<endl;
                Q.pop();
            }
        }
    }
}

int main()
{
    int n,num;
    string s;
    while(~scanf("%d",&n))
    {
        while(n--)
        {
            cin>>num>>s;
            if(s.compare("FIFO")==0)
                fifo(num);
            else
                filo(num);
        }
    }
}