Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
 Register new ID


Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4891    Accepted Submission(s): 2194

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 $r_i$ hours on the $i$-th course before its exam starts, or he will fail it. The $i$-th course's exam will take place $e_i$ hours later from now, and it will last for $l_i$ 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.

First line: an positive integer $T \leq 20$ indicating the number of test cases.
There are T cases following. In each case, the first line contains an positive integer $n \leq 10^5$, and $n$ lines follow. In each of these lines, there are 3 integers $r_i, e_i, l_i$, where $0 \leq r_i, e_i, l_i \leq 10^9$.


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


Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-06-17 02:37:14, Gzip enabled