zoukankan      html  css  js  c++  java
  • 【模拟】UVa 12108

    When a student is too tired, he can't help sleeping in class, even if his favorite teacher is right here in front of him. Imagine you have a class of extraordinarily tired students, how long do you have to wait, before all the students are listening to you and won't sleep any more? In order to complete this task, you need to understand how students behave.

    When a student is awaken, he struggles for a <tex2html_verbatim_mark>minutes listening to the teacher (after all, it's too bad to sleep all the time). After that, he counts the number of awaken and sleeping students (including himself). If there are strictly more sleeping students than awaken students, he sleeps for b <tex2html_verbatim_mark>minutes. Otherwise, he struggles for another a <tex2html_verbatim_mark>minutes, because he knew that when there is only very few sleeping students, there is a big chance for them to be punished! Note that a student counts the number of sleeping students only when he wants to sleep again.

    Now that you understand each student could be described by two integers a <tex2html_verbatim_mark>and b <tex2html_verbatim_mark>, the length of awaken and sleeping period. If there are always more sleeping students, these two periods continue again and again. We combine an awaken period with a sleeping period after it, and call the combined period an awaken-sleeping period. For example, a student with a = 1 <tex2html_verbatim_mark>and b = 4 <tex2html_verbatim_mark>has an awaken-sleeping period of awaken-sleeping-sleeping-sleeping-sleeping. In this problem, we need another parameter c <tex2html_verbatim_mark>(1$ le$c$ le$a + b) <tex2html_verbatim_mark>to describe a student's initial condition: the initial position in his awaken-sleeping period. The 1st and 2nd position of the period discussed above are awaken and sleeping, respectively.

    Now we use a triple (abc) <tex2html_verbatim_mark>to describe a student. Suppose there are three students (2, 4, 1), (1, 5, 2) and (1, 4, 3), all the students will be awaken at time 18. The details are shown in the table below.

    epsfbox{p3785.eps}<tex2html_verbatim_mark>
    Table 1. An example

    Write a program to calculate the first time when all the students are not sleeping.

    Input 

    The input consists of several test cases. The first line of each case contains a single integer n (1$ le$n$ le$10), the number of students. This is followed by n lines, each describing a student. Each of these lines contains three integers abc (1$ le$ab$ le$5) , described above. The last test case is followed by a single zero, which should not be processed.

    Output 

    For each test case, print the case number and the first time all the students are awaken. If it'll never happen, output -1.

    Sample Input 

    3 
    2 4 1 
    1 5 2 
    1 4 3 
    3 
    1 2 1 
    1 2 2 
    1 2 3
    0

    Sample Output 

    Case 1: 18 
    Case 2: -1

    题意:每个学生(1<=n<=10)存在一个awake-sleep周期,当这个学生到awake的最后一刻时,他要判断当前睡觉和醒的学生的人数,如果睡觉的人数绝对大于醒着的人数,那么他要继续保持清醒a分钟,否则就进入睡觉状态。
    对于不存在全部醒的状态,由于每个学生的周期比较短,可以自行设置一个时间上线。超过这个上线就视为不存在。事实证明取500的时候就可以A了。
    水。注意状态的转换更新即可。

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstdlib>
     4 #include<cstring>
     5 using namespace std;
     6 const int maxn = 500;
     7 struct Stu
     8 {
     9     int a, b, c, period;
    10     bool sleep;
    11 }st[15];
    12 
    13 int main()
    14 {
    15     int n, kase = 0;
    16     int awake = 0, sleep = 0;
    17     while(~scanf("%d", &n) && n)
    18     {
    19         kase++;
    20         for(int i = 0; i < n; i++)
    21         {
    22             scanf("%d%d%d", &st[i].a, &st[i].b, &st[i].c);
    23             st[i].period = st[i].a + st[i].b;
    24             st[i].sleep = (st[i].c > st[i].a) ? true : false;
    25         }
    26         int t = 1; bool Allawake = false;
    27         while(t <= maxn)
    28         {
    29             awake = 0; sleep=0;
    30             for(int i = 0; i < n; i++)
    31             {
    32                 if(!st[i].sleep) awake++;
    33                 else sleep++;
    34             }
    35             if(awake == n) {Allawake = true; break;}
    36             for(int i = 0; i < n; i++)
    37             {
    38                 if(st[i].c == st[i].a)
    39                 {
    40                     if(sleep <= awake)   {st[i].sleep = false; st[i].c = 1;}
    41                     else {st[i].c++; st[i].sleep = true;}
    42                 }
    43                 else if(st[i].c == st[i].period)
    44                 {
    45                     st[i].c = 1;
    46                     st[i].sleep = false;
    47                 }
    48                 else
    49                 {
    50                     st[i].c++;
    51                 }
    52             }
    53             t++;
    54         }
    55         if(Allawake) printf("Case %d: %d
    ", kase, t);
    56         else printf("Case %d: -1
    ", kase);
    57     }
    58     return 0;
    59 }
  • 相关阅读:
    安装Sql Server 2008 错误:the folder "c:\temp\sql2008_fullsp3_standard\pcu" you specified is not for pcusource input setting. Specify a valid folder.
    Log4Net error: Inheritance security rules violated while overriding member: 'log4net.Util.ReadOnlyPropertiesDictionary.GetObjectData.....
    Java成长路线
    项目开发之故事经典:教授的裤子分析
    书籍的未来数字化革命的产物:电子书
    如何访问我的博客
    ComboBox应该如何绑定数据
    C#中的常用关键字
    如何编写优秀软件
    为什么现在都用面向对象开发,为什么现在都用分层开发结构?
  • 原文地址:https://www.cnblogs.com/LLGemini/p/4333292.html
Copyright © 2011-2022 走看看