PivotOJ

Grass Segments

시간 제한: 2000ms메모리 제한: 1024MB출처: USACO 2024 Open GoldBOJ 31767

문제

Bessie is planting some grass on the positive real line. She has NN (2N21052\le N\le 2\cdot 10^5) different cultivars of grass, and will plant the iith cultivar on the interval [i,ri][\ell_i, r_i] (0<i<ri1090 < \ell_i < r_i \leq 10^9).

In addition, cultivar ii grows better when there is some cultivar jj (jij\neq i) such that cultivar jj and cultivar ii overlap with length at least kik_i (0<kirii0 < k_i \leq r_i - \ell_i). Bessie wants to evaluate all of her cultivars. For each ii, compute the number of jij\neq i such that jj and ii overlap with length at least kik_i.

입력

The first line contains NN.

The next NN lines each contain three space-separated integers i\ell_i, rir_i, and kik_i.

출력

The answers for all cultivars on separate lines.

예제

예제 1

입력
2
3 6 3
4 7 2
출력
0
1

예제 2

입력
4
3 6 1
2 5 1
4 10 1
1 4 1
출력
3
3
2
2

예제 3

입력
5
8 10 2
4 9 2
3 7 4
5 7 1
2 7 1
출력
0
3
1
3
3
코드를 제출하려면 로그인하세요.