zoukankan      html  css  js  c++  java
  • HDU1702: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): 10095    Accepted Submission(s): 5066


    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
     

    Source
     

    Recommend
    lcy   |   We have carefully selected several similar problems for you:  1701 1700 1703 1704 1706 

    每组数据结束后,记得把队列/栈清空,否则会wa

    empty()用来检查队列/栈是否为空,为空返回true

    #include<cstdio>
    #include<cstring>
    #include<iostream>
    #include<cstdlib>
    #include<algorithm> 
    #include<queue>
    #include<stack>
    using namespace std;
    int main()
    {
    	int t,n,m;
    	char ch[50],sh[50];
    	cin>>t;
    	queue<int>que;
    	stack<int>s;
    	while(t--)
    	{
    		while(!s.empty()) s.pop();
    		while(!que.empty()) que.pop();//直到队列/栈空的时候,停止操作 
    		cin>>n>>ch;
    		if(strcmp(ch,"FIFO")==0)
    		{
    			for(int i=0;i<n;i++)
    			{
    				
    				cin>>sh;
    				if(strcmp(sh,"IN")==0)
    				{
    					cin>>m;
    					que.push(m);
    				}
    				if(strcmp(sh,"OUT")==0)
    				{
    					if(que.size()>0)
    					{
    						cout<<que.front()<<endl;
    						que.pop(); 
    					}
    					else cout<<"None
    ";
    				} 	
    			}
    		}
    		if(strcmp(ch,"FILO")==0)
    		{
    			for(int i=0;i<n;i++)
    			{
    				
    				cin>>sh;
    				if(strcmp(sh,"IN")==0)
    				{
    					cin>>m;
    					s.push(m);
    				 } 
    				if(strcmp(sh,"OUT")==0)
    				{
    					if(s.size()>0)
    					{
    						cout<<s.top()<<endl;
    						s.pop();
    					}
    					else cout<<"None
    ";
    				}
    			}
    		}
    	}
    	return 0;
    } 

  • 相关阅读:
    JS正则与PHP正则
    关于微信扫码支付的流程
    Jquery快速入门
    phpstorm快捷键大全
    CentOS 7.3 下部署基于 Node.js的微信小程序商城
    一个故事告诉你比特币的原理及运作机制 (转 2013)
    mysql The used table type doesn’t support FULLTEXT indexes 解决方案 (phpstudy 会出现),coten不会
    linux下使用 du查看某个文件或目录占用磁盘空间的大小
    ◆织梦内容管理系统模板标签代码参考
    Linux 下挂载新硬盘方法(转)
  • 原文地址:https://www.cnblogs.com/Friends-A/p/9309040.html
Copyright © 2011-2022 走看看