CF762E.Radio stations
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
In the lattice points of the coordinate line there are n radio stations, the i -th of which is described by three integers:
- xi — the coordinate of the i -th station on the line,
- ri — the broadcasting range of the i -th station,
- fi — the broadcasting frequency of the i -th station.
We will say that two radio stations with numbers i and j reach each other, if the broadcasting range of each of them is more or equal to the distance between them. In other words min(ri,rj)>=∣xi−xj∣ .
Let's call a pair of radio stations (i,j) bad if i<j , stations i and j reach each other and they are close in frequency, that is, ∣fi−fj∣<=k .
Find the number of bad pairs of radio stations.
输入格式
The first line contains two integers n and k ( 1<=n<=105 , 0<=k<=10 ) — the number of radio stations and the maximum difference in the frequencies for the pair of stations that reach each other to be considered bad.
In the next n lines follow the descriptions of radio stations. Each line contains three integers xi , ri and fi ( 1<=xi,ri<=109 , 1<=fi<=104 ) — the coordinate of the i -th radio station, it's broadcasting range and it's broadcasting frequency. No two radio stations will share a coordinate.
输出格式
Output the number of bad pairs of radio stations.
输入输出样例
输入#1
3 2 1 3 10 3 2 5 4 10 8
输出#1
1
输入#2
3 3 1 3 10 3 2 5 4 10 8
输出#2
2
输入#3
5 1 1 3 2 2 2 4 3 2 1 4 2 1 5 3 3
输出#3
2
输入#4
5 1 1 5 2 2 5 4 3 5 1 4 5 1 5 5 3
输出#4
5