uva12108
来源:互联网 发布:专业网络公关 编辑:程序博客网 时间:2024/06/13 13:09
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 10;
struct Stu {
int a, b, c;
bool is_sleep()
{
return c > a;
}
int next_minute(int m, bool can_sleep)
{
if (++c > a+b) {c = 1; m--;}
else if (c == a+1) {
if (can_sleep) m++;
else c = 1;
}
return m;
}
};
int main()
{
int n, m, t;
Stu s[N];
int kase = 0;
while (scanf("%d", &n) && n) {
m = 0;
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &s[i].a, &s[i].b, &s[i].c);
if (s[i].is_sleep()) m++;
}
for (t = 1; t <= 500; t++) {
if (m == 0) break;
bool can_sleep = (m > n-m) ? 1 : 0;
for (int i = 0; i < n; i++)
m = s[i].next_minute(m, can_sleep);
}
if (m == 0) printf("Case %d: %d\n", ++kase, t);
else printf("Case %d: -1\n", ++kase);
}
return 0;
}
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 10;
struct Stu {
int a, b, c;
bool is_sleep()
{
return c > a;
}
int next_minute(int m, bool can_sleep)
{
if (++c > a+b) {c = 1; m--;}
else if (c == a+1) {
if (can_sleep) m++;
else c = 1;
}
return m;
}
};
int main()
{
int n, m, t;
Stu s[N];
int kase = 0;
while (scanf("%d", &n) && n) {
m = 0;
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &s[i].a, &s[i].b, &s[i].c);
if (s[i].is_sleep()) m++;
}
for (t = 1; t <= 500; t++) {
if (m == 0) break;
bool can_sleep = (m > n-m) ? 1 : 0;
for (int i = 0; i < n; i++)
m = s[i].next_minute(m, can_sleep);
}
if (m == 0) printf("Case %d: %d\n", ++kase, t);
else printf("Case %d: -1\n", ++kase);
}
return 0;
}
阅读全文
0 0
- uva12108
- UVa12108
- uva12108
- UVA12108-Extraordinarily Tired Students
- UVa12108 代码短。。。。
- UVA12108--Extraordinarily Tired Students
- 模拟暴力 uva12108
- UVA12108 Extraordinarily Tired Students 【模拟】
- UVA12108 Extraordinarily Tired Students(超级大模拟)
- UVA12108-4.8(ti)-Extraordinarily Tired Students
- 习题4-8 特别困的学生 UVa12108
- 习题4-8 特别困的学生 UVa12108
- 习题 4-8 特别困的学生 uva12108
- uva12108 特别困的学生 (Extraordinary Tired Students
- 算法竞赛入门经典(第2版)习题4-8 特别困的学生UVa12108
- [刷题]算法竞赛入门经典(第2版) 4-8/UVa12108 - Extraordinarily Tired Students
- 算法竞赛入门经典(第2版)习题4-8 特别困的学生 Extraordinarily Tired Students UVa12108
- 算法竞赛入门经典 第二版 习题4-8 特别困的学生 Extraordinarily Tired Students uva12108
- LG1028 数的求解(记录)
- item-cf改进
- Java中的单例模式
- 神奇的bug之逗比解决法
- C、C++一次将整个文件读入内存
- uva12108
- 数据结构之--优先级队列(Java代码)
- 浅谈KVC
- 51nod 1627 区间交
- 重写scrapy中间件之RetryMiddleware
- Java 内置数据类型总结
- HDOJ-1702 ACboy needs your help again!
- es6学习过程(二)
- 标准模板库 STL-1 编程题#1(Coursera 程序设计与算法 专项课程3;用法:迭代器 ostream_iterator,容器 set)