[USACO09OPEN] Ski Lessons G

Farmer John 想要带着 Bessie 一起在科罗拉多州一起滑雪。很不幸，Bessie 滑雪技术并不精湛。Bessie了解到，在滑雪场里，每天会提供 $S(0 \le S \le 100)$ 门滑雪课。第 $i$ 节课始于 $M_i(1 \le M_i \le 10000)$ 上的时间为 $L_i(1 \le L_i \le 10000)$。 上完第 $i$ 节课后，Bessie 的滑雪能力会变成 $A_i(1 \le A_i \le 100)$. 注意：这个能力是绝对的，不是能力的增长值。 Bessie 买了一张地图，地图上显示了 $N(1 \le N \le 10,000)$ 个可供滑雪的斜坡，从第i个斜坡的顶端滑至底部所需的时长 $D_i(1 \le D_i \le 10000)$，以及每个斜坡所需要的滑雪能力 $C_i(1 \le C_i \le 100)$，以保证滑雪的安全性。Bessie 的能力必须大于等于这个等级，以使得她能够安全滑下。 Bessie 可以用她的时间来滑雪，上课，或者美美地喝上一杯可可汁，但是她必须在 $T(1 \le T \le 10000)$ 时刻离开滑雪场。这意味着她必须在 $T$ 时刻之前完成最后一次滑雪。 求 Bessie 在实现内最多可以完成多少次滑雪。这一天开始的时候，她的滑雪能力为 $1$.

Farmer John wants to take Bessie skiing in Colorado. Sadly, Bessie is not really a very good skier. Bessie has learned that the ski resort is offering S (0 <= S <= 100) ski classes throughout the day. Lesson i starts at time M\_i (1 <= M\_i <= 10,000) and lasts for time L\_i (1 <= L\_i <= 10,000). After lesson i, Bessie's ski ability becomes A\_i (1 <= A\_i <= 100). Note: this ability is an absolute, not an incremental change. Bessie has purchased a map which shows all N (1 <= N <= 10,000) ski slopes along with the time D\_i (1 <= D\_i <= 10,000) required to ski down slope i and the skill level C\_i (1 <= C\_i <= 100) required to get down the slope safely. Bessie's skill level must be greater than or equal to the skill level of the slope in order for her to ski down it. Bessie can devote her time to skiing, taking lessons, or sipping hot cocoa but must leave the ski resort by time T (1 <= T <= 10,000), and that means she must complete the descent of her last slope without exceeding that time limit. Find the maximum number of runs Bessie can complete within the time limit. She starts the day at skill level 1. Extra feedback will be provided on the first 50 submissions.

\* Line 1: Three space-separated integers: T, S, and N \* Lines 2..S+1: Line i+1 describes ski lesson i with three space-separated integers: M\_i, L\_i, and A\_i \* Lines S+2..S+N+1: Line S+i+1 describes ski slope i with two space-separated integers: C\_i and D\_i.

A single integer on a line by itself, the maximum number of runs that Bessie may ski within the time limit.

10 1 2 
3 2 5 
4 1 
1 3 

6 

Ski the second slope once, take the lesson, and ski the first slope 5 times before time is up: a total of 6 slopes.