hdoj 1702 ACboy needs your help again!

最新推荐文章于 2023-06-14 17:05:54 发布

原创最新推荐文章于 2023-06-14 17:05:54 发布 · 479 阅读

0 ·

CC 4.0 BY-SA版权

STL 专栏收录该内容

43 篇文章

订阅专栏

本博客探讨如何通过解决一系列迷宫问题来解救被绑架的AC男孩。问题涉及先进数据结构如栈和队列的应用，以及理解'FIFO'和'FILO'的概念。读者将学习如何在不同情况下正确使用这些数据结构，以实现成功救援。

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

ACboy needs your help again!

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

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

STL 栈和队列练习。

#include<stdio.h>
#include<string.h>
#include<stack>
#include<queue>
using namespace std;
void que(int n)
{
    int a,b;
    char str[5];
    queue<int>q;
    while(n--)
    {
        scanf("%s",str);
        if(!strcmp(str,"IN"))
        {
            scanf("%d",&a);
            q.push(a);//入 
        }
        else
        {
            if(q.empty())//队列为空 返回true 
            printf("None\n");
            else
            {
                b=q.front();
                printf("%d\n",b);
                q.pop();
                     
            }
        }
    }
    while(!q.empty())
    {
        q.pop();
    }
}
void sta(int n)
{
    int a,b;
    char str[5];
    stack<int>s;//栈
    while(n--)
    {
        scanf("%s",str);
        if(!strcmp(str,"IN"))
        {
            scanf("%d",&a);
            s.push(a);//入 
        }
        else
        {
            if(s.empty())//栈为空 返回true 
            printf("None\n");
            else
            {
                b=s.top();
                printf("%d\n",b);
                s.pop();
            }
        }
    } 
    while(!s.empty())
    {
        s.pop();
    }
}
int main()
{
    int t,n,i,j;
    char s1[6];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d %s",&n,s1);
        if(!strcmp(s1,"FIFO"))//队列
        {
            que(n);
        }
        else
        {
            sta(n);
        } 
    }
    return 0;
}