HDOJ 1702 ACboy needs your help again!

ACboy needs your help again!

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

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<stdio.h>
#include<string.h>
int main()
{
	int t,n,i,j,num,a[10000];
	char str[10],mark[10];
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%s",&n,str);
		if(strcmp(str,"FIFO")==0)//队列 
		{
			i=j=0;//i为进队列数，j为出队列数 
			while(n--)
			{
				scanf("%s",mark);
				if(strcmp(mark,"IN")==0)
				{
					scanf("%d",&num);
					a[i++]=num;//进队列 
				}
				else
				{
					if(j>=i)//判断队列是否为空 
					   printf("None\n");
					else
					   printf("%d\n",a[j++]);//出队列 
				}
			}
		}
		else if(strcmp(str,"FILO")==0)//栈 
		{
			i=0;
			while(n--)
			{
				scanf("%s",mark);
				if(strcmp(mark,"IN")==0)
				{
					scanf("%d",&num);
					a[i++]=num;//进栈，注意此处i值在a[i]赋值后自增1，即此处后a[i]是没有被赋值的 
				}
				else
				{
					if(i<1)//若a[0]已经被赋值，i必等于1 
					   printf("None\n");
					else
					   printf("%d\n",a[--i]);//出栈，先自减再经行运算 
				}
			}
		}
	}
	return 0;
}