Exam
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1944 Accepted Submission(s): 948
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.
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.
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
Source
1 #include
2 using namespace std;
3
4 const int MAXN = 1e5 + 5;
5
6 struct Node {
7 int r;
8 int e;
9 int l;
10 } w[MAXN];
11
12 bool cmp(Node a, Node b)
13 {
14 return a.e < b.e;
15 }
16
17 int main()
18 {
19 int t;
20 int n;
21 int i;
22 int spa;
23 int cas = 0;
24
25 scanf("%d", &t);
26
27 while (t--) {
28 scanf("%d", &n);
29 for (i = 0; i < n; ++i) {
30 scanf("%d%d%d", &w[i].r, &w[i].e, &w[i].l);
31 }
32 sort(w, w + n, cmp);
33 printf("Case #%d: ", ++cas);
34 spa = w[0].e;
35 spa -= w[0].r;
36 if (spa < 0) {
37 printf("NO\n");
38 continue;
39 }
40
41 for (i = 1; i < n; ++i) {
42 spa += w[i].e - (w[i - 1].e + w[i - 1].l);
43 spa -= w[i].r;
44 if (spa < 0) {
45 printf("NO\n");
46 continue;
47 }
48 }
49 printf("YES\n");
50 }
51
52 return 0;
53 }
推荐链接
发表评论