zoukankan      html  css  js  c++  java
  • Hdu 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): 7824    Accepted Submission(s): 3945

    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<stack>
    #include<queue>
    #include<string.h>
    using namespace std;
    int main()
    {
     int N,i;
    scanf("%d",&N);
    while(N--)
     {
      int n,k;
      char a[5],s[4];
     scanf("%d %s",&n,a);
      if(strcmp(a,"FIFO")==0)
      {
        queue<int> qu;
       for(k=0;k<n;k++)
       { 
        scanf("%s",s);
       if(strcmp(s,"IN")==0)
       {
        int u;
        scanf("%d",&u);
        qu.push(u);
       } 
       else
       {
        if(qu.empty())
        printf("None
    ");
        else
        {
         int u=qu.front();
          printf("%d
    ",u);
         qu.pop();
        }
       }
       }
      }
     else
     { stack<int> qu;
          for(k=0;k<n;k++)
      {  
          scanf("%s",s);
      if(strcmp(s,"IN")==0)
      {
       int u;
       scanf("%d",&u);
       qu.push(u);
      } 
      else
      {
       if(qu.empty())
        printf("None
    ");
       else
       {
       int u=qu.top();
       printf("%d
    ",u);
            qu.pop();
       }
      }
       }
     }
    }
     return 0;
    }
    

      

  • 相关阅读:
    [Elasticsearch] 向已存在的索引中加入自己定义filter/analyzer
    Hibernate持久化对象的状态
    android 利用cmdline,将參数从preloader传递到kernel
    HDOJ的题目分类
    activiti自己定义流程之Spring整合activiti-modeler实例(七):任务列表展示
    十大广泛使用的Linux发行版
    Windows下配置Git服务器和客户端 超全
    适当使用enum做数据字典 ( .net c# winform csharp asp.net webform )
    System.Drawing.Image在Save之后Type变了
    winform ListView应用之分组、重绘图标、网格线 (c# .net winform)
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7058022.html
Copyright © 2011-2022 走看看