hdoj--5240--Exam()
来源:互联网 发布:seo按天付费 编辑:程序博客网 时间:2024/05/22 06:05
Exam
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1029 Accepted Submission(s): 511
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 leastri 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), wherex 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
We have carefully selected several similar problems for you: 5551 5550 5549 5548 5547
无脑排序加判断
无脑排序加判断
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct node{int t,e,l;}edge[100000];bool cmp(node s1,node s2){return s1.e<s2.e;}int main(){int t;int Case=1;scanf("%d",&t);while(t--){int n;scanf("%d",&n);for(int i=0;i<n;i++)scanf("%d%d%d",&edge[i].t,&edge[i].e,&edge[i].l);sort(edge,edge+n,cmp);int sum=0;int flog=0;for(int i=0;i<n;i++){sum+=edge[i].t;if(sum>edge[i].e){flog=1;break;}sum+=edge[i].l;}printf("Case #%d: ",Case++);if(flog) printf("NO\n");else printf("YES\n");}return 0;}
0 0
- hdoj--5240--Exam()
- HDOJ 5240 Exam (贪心)
- hdoj Exam 5240 (简单逻辑题)
- hdoj 5240 Exam 【模拟】
- HDOJ 5240 Exam(水)
- hdoj 5240 Exam
- hdoj 5240 Exam
- hdoj 5240 Exam【贪心】
- HDOJ 5240 Exam
- HDOJ 5240 Exam
- HDOJ 5240 Exam 【简单模拟】
- HDOJ 5240 Exam 【sort排序&&模拟】
- HDOJ 4473 Exam 暴力枚举
- HDU 5240 Exam(贪心水题)
- HDU 4473 HDOJ Exam (推理,5级)
- HDU 5240 Exam
- HDU 5240 Exam
- HDU 5240 Exam
- linux中软硬连接文件命令
- 趣文:编程语言伪简史
- 3道比较有用的oc练习题
- 【线性表】单链表
- CSS小技巧
- hdoj--5240--Exam()
- 省市区用字典实现
- CoreData
- CSS学习笔记之<层叠>
- ERROR 1036 (HY000): Table 'teacher' is read only
- 服务器的产品类型之塔式|机架式|刀片式
- 省市县用对象实现
- 顺序表应用1:多余元素删除之移位算法
- hibernate的type类型对照表