CF1045G AI robots

题面

题目链接

解题思路

如果两个人i,j能够相互看到，我们不妨令x[i]<x[j],用j去统计i。
考虑离线的维护，我们扫描距离，当到x[i]时，将这个点插入,到x[i]+r[r]时，将其删除。当统计到i时，我们知道此时数据结构里的都是能够看到i的，我们要询问数据结构内有多少个j，q[i] - k <= q[j] <= q[i] + k,且x[i]-r[i]<=x[j]<=x[i]。用树套树维护即可。
复杂度$O(nlo{g}^{2}n)$。

代码

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;

void read(int &x) {
	x = 0; char c = getchar();
	while (c < '0' || c > '9') c = getchar();
	while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
}

const int N = 1e5 + 100;

int tot = N, tpx, ls[N * 200], rs[N * 200], cnt[N * 200];

void insert(int id, int x, int l, int r, int p) {
	cnt[p] += x;
	if (l == r) return;
	int m = (l + r) / 2;
	if (id <= m) {
		if (!ls[p]) ls[p] = ++tot;
		insert(id, x, l, m, ls[p]);
	}
	else {
		if (!rs[p]) rs[p] = ++tot;
		insert(id, x, m + 1, r, rs[p]);
	}
}

int query(int rl, int rr, int l, int r, int p) {
	if (rl == l && rr == r) return cnt[p];
	int m = (l + r) / 2;
	if (rr <= m) return query(rl, rr, l, m, ls[p]);
	else if (m < rl) return query(rl, rr, m + 1, r, rs[p]);
	else return query(rl, m, l, m, ls[p]) + query(m + 1, rr, m + 1, r, rs[p]);
}

void add(int q, int id, int x) {
	for (; q > 0; q -= q & -q) insert(id, x, 1, tpx, q);
}

int query(int ql, int qr, int l, int r) {
	int ans = 0;
	for (; ql < N; ql += ql & -ql) ans += query(l, r, 1, tpx, ql);
	for (qr++; qr < N; qr += qr & -qr) ans -= query(l, r, 1, tpx, qr);
	return ans;
}


int n, k, tpq;
int hsx[N], hsq[N], xx[N], rr[N], qq[N], idx[N];
vector<int> Inc[N], Dec[N];

int main() {
	//freopen("0.txt", "r", stdin);
	read(n); read(k);
	for (int i = 1; i <= n; i++) {
		read(xx[i]); read(rr[i]); read(qq[i]);
		hsx[++tpx] = xx[i];
		hsq[++tpq] = qq[i];
	}
	sort(hsx + 1, hsx + tpx + 1);
	tpx = unique(hsx + 1, hsx + tpx + 1) - hsx - 1;
	sort(hsq + 1, hsq + tpq + 1);
	tpq = unique(hsq + 1, hsq + tpq + 1) - hsq - 1;
	for (int i = 1; i <= n; i++) {
		int r = upper_bound(hsx + 1, hsx + tpx + 1, xx[i] + rr[i]) - hsx - 1;
		xx[i] = lower_bound(hsx + 1, hsx + tpx + 1, xx[i]) - hsx;
		qq[i] = lower_bound(hsq + 1, hsq + tpq + 1, qq[i]) - hsq;
		Inc[xx[i]].push_back(i); Dec[r].push_back(i);
	}
	long long ans = 0;
	for (int i = 1; i <= tpx; i++) {
		for (int id : Inc[i]) {
			int ql = lower_bound(hsq + 1, hsq + tpq + 1, hsq[qq[id]] - k) - hsq;
			int qr = upper_bound(hsq + 1, hsq + tpq + 1, hsq[qq[id]] + k) - hsq - 1;
			int l = lower_bound(hsx + 1, hsx + tpx + 1, hsx[xx[id]] - rr[id]) - hsx;
			ans += query(ql, qr, l, xx[id]);
			add(qq[id], xx[id], 1);
		}
		for (int id : Dec[i]) add(qq[id], xx[id], -1);
	}
	printf("%lld\n", ans);
	return 0;
}