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;
    }
    

      

  • 相关阅读:
    二、缴费证明(完税凭证)开具渠道
    DateTime的具体用法
    获取HTML页面高度和分辨率
    JS获取当前日期及时间
    CSS textindent 属性
    combotree初始化加载折叠
    关于C#中将数字转换为指定格式
    jquery cookie用法(获取cookie值,删除cookie)
    如何在Sql Server中读取最近一段时间的记录,比如取最近3天的或最近3个月的记录。
    定位/定位偏移量
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7058022.html
Copyright © 2011-2022 走看看