Description：

Solution：

Code：

#include<algorithm>

#include<iostream>

#include<cstdlib>

#include<cstdio>

#include<cmath>

#include<map>

#include<cstring>

using namespace std;

int n,m;

#define MAXN 100010

struct robot

{

	int x,r,q;

}s[MAXN];

bool cmp_r(robot a,robot b){return a.r > b.r;}

int a[MAXN],cur = 0;

map<int,int> fr;

struct query

{

	int pos,x,y,ytop,ybot,type;

}q[MAXN << 2];

bool cmp_pos(query a,query b){return a.pos < b.pos;}

bool cmp_x(query a,query b)

{

	if(a.x == b.x)

	{

		if(a.type == 0)return true;

		else return false;

	}

	return a.x < b.x;

}

long long ans = 0;

int tot = 0;

struct BIT

{

	int c[MAXN];

	BIT(){memset(c,0,sizeof(c));}

	int lowbit(int x){return x & (-x);}

	void add(int p,int k){for(int i = p;i <= cur;i += lowbit(i))c[i] += k;return;}

	int query(int p){int res = 0;for(int i = p;i >= 1;i -= lowbit(i))res += c[i];return res;}

}t;

void cdq(int l,int r)

{

	if(l >= r)return;

	int mid = ((l + r) >> 1);

	cdq(l,mid);

	sort(q + l,q + mid + 1,cmp_x);

	sort(q + mid + 1,q + r + 1,cmp_x);

	int i = l,j = mid + 1;

	for(;i <= mid && j <= r;)

	{

		if(q[i].x <= q[j].x)

		{

			if(q[i].type == 0)

			{

				t.add(q[i].y,1);

			}

			++i;

		}

		else

		{

			if(q[j].type != 0)

			{

				ans += q[j].type * (t.query(q[j].ytop) - t.query(q[j].ybot - 1));

			}

			++j;

		}

	}

	for(int k = j;k <= r;++k)ans += q[k].type * (t.query(q[k].ytop) - t.query(q[k].ybot - 1));

	for(int k = l;k < i;++k)

	{

		if(q[k].type == 0)

		{

			t.add(q[k].y,-1);

		}

	}

	sort(q + mid + 1,q + r + 1,cmp_pos);

	cdq(mid + 1,r);

	return;

}

int main()

{

	scanf("%d%d",&n,&m);

	for(int i = 1;i <= n;++i)

	{

		scanf("%d%d%d",&s[i].x,&s[i].r,&s[i].q);

		a[i] = s[i].q;

	}

	sort(a + 1,a + 1 + n);

	for(int i = 1;i <= n;++i)

		if(i == 1 || a[i] != a[i - 1])

			fr[a[i]] = ++cur;

	fr[0x3f3f3f3f] = 1;

	sort(s + 1,s + 1 + n,cmp_r);

	for(int i = 1;i <= n;++i)

	{

		map<int,int>::iterator l;

		l = fr.upper_bound(s[i].q + m);--l;

		map<int,int>::iterator r;

		r = fr.lower_bound(s[i].q - m);

		++tot;q[tot] = (query){tot,s[i].x - s[i].r - 1,0,l -> second,r -> second,-1};

		++tot;q[tot] = (query){tot,s[i].x + s[i].r,0,l -> second,r -> second,1};

		++tot;q[tot] = (query){tot,s[i].x,fr[s[i].q],0,0,0};

	}

	cdq(1,tot);

	cout << ans << endl;

	return 0;

}