| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 1024 MB | 140 | 72 | 69 | 51.111% |
It's raining apples! At certain points in time, some number of apples will hit the number line. At certain points in time, some of Farmer John's cows will arrive on the number line and start catching apples.
If an apple hits the number line without a cow to catch it, it is lost forever. If a cow and an apple arrive at the same time, the cow catches it. Each cow can travel one unit per second. Once a cow catches a single apple, she exits the number line.
If FJ's cows collaborate optimally, how many apples can they catch in total?
The first line contains $N$ (1ドル\le N\le 2\cdot 10^5$), the number of times apples hit the number line or FJ's cows appear.
The next $N$ lines each contain four integers $q_i,ドル $t_i,ドル $x_i,ドル and $n_i$ ($q_i\in \{1,2\}, 0\le t_i\le 10^9, 0\le x_i\le 10^9, 1\le n_i\le 10^3$).
It is guaranteed that all of the ordered pairs $(t_i,x_i)$ are distinct.
The maximum number of apples FJ's cows may collectively catch.
5 2 5 10 100 2 6 0 3 2 8 10 7 1 2 4 5 1 4 7 6
10
In this example, none of the 100ドル$ apples that land at time $t=5$ may be caught. Here is a way for 10ドル$ apples to be caught:
5 2 5 10 100 2 6 0 3 2 8 11 7 1 2 4 5 1 4 7 6
9
Here again, none of the apples that land at time $t=5$ may be caught. Furthermore, none of the cows that arrive at time $t=2$ may catch any of the apples that land at time $t=8$. Here is a way for 9ドル$ apples to be caught: