Exam
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1047 Accepted Submission(s): 522
Problem Description
As this term is going to end, DRD needs to prepare for his final exams.
DRD has n 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 n 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.
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 integer n≤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 n≤105 , and n lines follow. In each of these lines, there are 3 integers ri,ei,li , where 0≤ri,ei,li≤109 .
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
2 3 3 2 2 5 100 2 7 1000 2 3 3 10 2 5 100 2 7 1000 2
Sample Output
Case #1: NO Case #2: YES贪心思想:T E L ,分别代表这门课需要复习的时间,离这门课考试 剩余的时间,这门课的考试时间!把数据优先按照E : 离这门课考试 剩余的 时间,进行排序,E相同时,再按照T排序!代码:#include<stdio.h>//要控制好时间! #include<algorithm> using namespace std; struct node { int t,e,l; }a[110000]; int cmp(node a,node b) { if(a.e ==b.e ) return a.t <b.t ; return a.e <b.e; } int main() { int t,flag=1; scanf("%d",&t); while(t--) { int n,i,j; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&a[i].t ,&a[i].e,&a[i].l ); } sort(a,a+n,cmp); int mark=0; int time=0; for(i=0;i<n;i++) { if(time + a[i].t > a[i].e ) { mark=1; break; } time+=a[i].t;//加上复习时间! time+=a[i].l ;//注意考试的时间也要加上! } if(mark) printf("Case #%d: NO\n",flag++); else printf("Case #%d: YES\n",flag++); } return 0; }