【HDU】1702---ACboy needs your help again!（栈&&队列）

最新推荐文章于 2022-02-25 20:51:34 发布

原创最新推荐文章于 2022-02-25 20:51:34 发布 · 493 阅读

0 ·

CC 4.0 BY-SA版权

栈与队列专栏收录该内容

11 篇文章

订阅专栏

面对怪物设置的谜题，玩家需运用栈和队列原理解决一系列命令问题，从“FIFO”和“FILO”中找到正确的出入顺序，才能成功营救被囚禁的ACboy。

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

ACboy needs your help again!HDU - 1702

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

思路分析：

	 FIFO先进先出，队列。FILO先进后出，栈。

代码如下：

#include<cstdio>
#include<queue>
#include<stack>
#include<cstring>
using namespace std;
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		stack<int> s;					//栈 
		queue<int> q;					//队列 
		int n,k;
		char str[6],s1[5];
		scanf("%d %s",&n,str);
		if(strcmp(str,"FIFO")==0)			//队列
		{
			while(n--)
			{
			//	getchar();
				scanf("%s",s1);
				if(s1[0]=='I')			//进队列 
				{
					scanf("%d",&k);
					q.push(k);
				}
				else if(s1[0]=='O')
				{
					if(q.empty() )			//队列为空 
						printf("None\n");
					else
					{
						int a=q.front() ;		//返回队列首元素的值 
						printf("%d\n",a);
						q.pop() ;		//弹出队列首元素 但不返回其值 
						
						
					}	
				}	 
			}
		}
		else if(strcmp(str,"FILO")==0)		//栈 
		{
			while(n--)
			{
			//	getchar();
				scanf("%s",s1);
				if(s1[0]=='I')
				{
					scanf("%d",&k);
					s.push(k);				//进栈 
				}	
				else if(s1[0]=='O')
				{
					if(s.empty() )			//栈为空 
						printf("None\n");
					else
					{
						int b=s.top() ;			//返回栈顶元素的值 
						printf("%d\n",b);
						s.pop() ;				//弹出栈顶元素，但不返回其值 
						
					}	
				}	 
			}
		}
	}
	return 0;
}