2014
02-24

# Extraordinarily Tired Students

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 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 minutes. Otherwise, he struggles for another a 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 and b, 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 and b=4 has an awaken-sleeping period of awaken-sleeping-sleeping-sleeping-sleeping. In this problem, we
need another parameter c (1 ≤ c ≤ a+b) 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 (a, b, c) 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.

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

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

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

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

Case 1: 18
Case 2: -1

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX = 100005;
int a[11], b[11], c[11];

int main()
{
//freopen("a.in","r",stdin); freopen("a.out","w",stdout);
int N, cas = 0;
while(scanf("%d", &N) == 1 && N)
{
int be = 100;
for(int i = 1; i <= N; i++)
scanf("%d%d%d", &a[i], &b[i], &c[i]);
int ans = 1, cnt;
for(; ans < MAX; ans++)
{
cnt = 0;
for(int i = 1; i <= N; i++)
if(c[i] <= a[i]) cnt++;
if(cnt == N) break;
for(int i = 1; i <= N; i++)
{
if(c[i] == a[i]+b[i] || c[i] == a[i] && cnt > N-cnt) c[i] = 0;
c[i]++;
}
}
if(ans == MAX) ans = -1;

printf("Case %d: %d\n", ++cas, ans);
}
return 0;
}