HDU1702:ACboy needs your help again!

最新推荐文章于 2022-09-21 19:00:15 发布

转载最新推荐文章于 2022-09-21 19:00:15 发布 · 68 阅读

为救被囚的ACboy，需解决怪物设置的问题：依据FIFO或FILO指令序列处理输入，使用队列或栈实现。本篇通过C++代码展示了如何根据不同的数据组织方式来解决问题。

摘要生成于 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

赤裸裸的栈和队列的应用

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

void que_ex(int n)
{
    queue<int> Q;
    char s[10];
    int a;
    while(n--)
    {
        scanf("%s",s);
        if(!strcmp(s,"IN"))
        {
            scanf("%d",&a);
            Q.push(a);
        }
        else if(!strcmp(s,"OUT"))
        {
            if(Q.empty())
                printf("None\n");
            else
            {
                printf("%d\n",Q.front());
                Q.pop();
            }
        }
    }
}

void sta_ex(int n)
{
    stack<int> S;
    char s[10];
    int a;
    while(n--)
    {
        scanf("%s",s);
        if(!strcmp(s,"IN"))
        {
            scanf("%d",&a);
            S.push(a);
        }
        else if(!strcmp(s,"OUT"))
        {
            if(S.empty())
                printf("None\n");
            else
            {
                printf("%d\n",S.top());
                S.pop();
            }
        }
    }
}

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        while(n--)
        {
            int m;
            char str[100];
            scanf("%d%s",&m,str);
            if(!strcmp(str,"FIFO"))
                que_ex(m);
            else if(!strcmp(str,"FILO"))
                sta_ex(m);
            else
                printf("error\n");
        }
    }

    return 0;
}