HDU 5240 Exam(贪心水题)
来源:互联网 发布:如何修改淘宝客佣金 编辑:程序博客网 时间:2024/05/17 06:56
Problem Description
As this term is going to end, DRD needs to prepare for his final exams.
DRD hasn exams. They are all hard, but their difficulties are different. DRD will spend at least ri hours on the i -th course before its exam starts, or he will fail it. The i -th course's exam will take place ei hours later from now, and it will last for li hours. When DRD takes an exam, he must devote himself to this exam and cannot (p)review any courses. Note that DRD can review for discontinuous time.
So he wonder whether he can pass all of his courses.
No two exams will collide.
DRD has
So he wonder whether he can pass all of his courses.
No two exams will collide.
Input
First line: an positive integer T≤20 indicating the number of test cases.
There are T cases following. In each case, the first line contains an positive integern≤105 , and n lines follow. In each of these lines, there are 3 integers ri,ei,li , where 0≤ri,ei,li≤109 .
There are T cases following. In each case, the first line contains an positive integer
Output
For each test case: output ''Case #x: ans'' (without quotes), where x is the number of test cases, and ans is ''YES'' (without quotes) if DRD can pass all the courses, and otherwise ''NO'' (without quotes).
Sample Input
233 2 25 100 27 1000 233 10 25 100 27 1000 2
Sample Output
Case #1: NOCase #2: YES
Source
The 2015 ACM-ICPC China Shanghai Metropolitan Programming Contest
Recommend
给出若干门课的通过需要复习的时间,考试开始时间和考试持续时间,求这个人能否参加和通过所有考试,贪心排序,看是否有重合的区间水题。
ps的代码:
#include <bits/stdc++.h>using namespace std;const int MAXN = 1e5 + 5;struct Node { int r; int e; int l;} w[MAXN];bool cmp(Node a, Node b){ return a.e < b.e;}int main(){ int t; int n; int i; int spa; int cas = 0; scanf("%d", &t); while (t--) { scanf("%d", &n); for (i = 0; i < n; ++i) { scanf("%d%d%d", &w[i].r, &w[i].e, &w[i].l); } sort(w, w + n, cmp); printf("Case #%d: ", ++cas); spa = w[0].e; spa -= w[0].r; if (spa < 0) { printf("NO\n"); continue; } for (i = 1; i < n; ++i) { spa += w[i].e - (w[i - 1].e + w[i - 1].l); spa -= w[i].r; if (spa < 0) { printf("NO\n"); continue; } } printf("YES\n"); } return 0;}
0 0
- HDU 5240 Exam(贪心水题)
- Hdu 5240 Exam【贪心】
- HDOJ 5240 Exam (贪心)
- HDU 5240 Exam (好水的题)
- hdoj 5240 Exam【贪心】
- HDU 5240 Exam
- HDU 5240 Exam
- HDU 5240 Exam
- HDU 5240:Exam【排序】
- hdu 5240 Exam
- Final Exam Arrangement(zju5044,贪心)
- HDOJ 5240 Exam(水)
- hdoj Exam 5240 (简单逻辑题)
- hdoj--5240--Exam()
- hdu 4473 Exam (思维题 问题转化)
- ZOJ3721 Final Exam Arrangement(贪心(区间选点))
- CodeForces 4B Before an Exam(贪心算法)
- ZOJ 3721 Final Exam Arrangement(模拟+贪心)
- 2016安徽程序竞赛C题
- OpenStack Ocata 安装(二)安装身份验证(Keystone)服务
- 二分贪心 F
- gdb与makefile
- Linux基础学习笔记之如何获取帮助
- HDU 5240 Exam(贪心水题)
- 导入第三方依赖库问题解决
- 【MPI学习1】简单MPI程序示例
- 二叉排序树之红黑树
- Java在终端中实时计算时使用float还是double?
- vmware虚拟机:ubuntu server安装vmware tools
- 例题6-1 UVa 210(deque 双端队列)
- [Ubuntu]网易云音乐libqt5libqgtk2缺失的解决方案
- A