『曼哈顿距离转切比雪夫距离·树状数组·扫描线』航空基地Airbase

$\mathrm{P}\mathrm{r}\mathrm{o}\mathrm{b}\mathrm{l}\mathrm{e}\mathrm{m}$

$\mathrm{S}\mathrm{o}\mathrm{l}\mathrm{u}\mathrm{t}\mathrm{i}\mathrm{o}\mathrm{n}$

我们考虑将曼哈顿距离转化为切比雪夫具体：
$$p(x,y)\to p^{\prime }(x+y,x-y)$$
我们要求$|x_1-x_2|+|y_1-y_2|\le d$,相当于要求$(x_2,y_2)$在以下四个边界点的菱形内。$$(x-d,y),(x+d,y),(x,y-d),(x,y+d)$$若我们将每一个点做了切比雪夫转化后，这四个点变成了便于处理的矩形：$$(x-d,y-d),(x+d,y-d),(x-d,y+d),(x+d,y+d)$$
然后我们就要求每一个点被多少矩形包含。

运用扫描线的思想，按照横坐标排序，变成求一个点被多少区间包含：区间修改，单点查询问题，用树状数组解决即可。

---

$\mathrm{S}\mathrm{o}\mathrm{l}\mathrm{u}\mathrm{t}\mathrm{i}\mathrm{o}\mathrm{n}$

#include <bits/stdc++.h>
#define int long long

using namespace std;
const int N = 3e5;

int n, m, k, cnt;
int b[N], res[N];
map < int, int > vis;

int read(void)
{
	int s = 0, w = 0; char c = getchar();
	while (!isdigit(c)) w |= c == '-', c = getchar();
	while (isdigit(c)) s = s*10+c-48, c = getchar();
	return w ? -s : s;
}

struct node {
	int x, y, val;
	friend bool operator < (node p1, node p2) {
		if (p1.x == p2.x) return p1.val < p2.val;
		return p1.x < p2.x;
	}
} a[N];

struct BIT {
	#define lowbit(x) (x & -x)
	int S[N * 10] = {};
	void add(int x, int v) {
		for (int i=x;i<=4e5;i+=lowbit(i))
			S[i] += v;
		return;
	}
	int  ask(int x) {
		int res = 0;
		for (int i=x;i>=1;i-=lowbit(i))
			res += S[i];
		return res;
	}
} tree;

signed main(void)
{
	freopen("airbase.in","r",stdin);
	freopen("airbase.out","w",stdout);
	n = read();
	for (int i=1;i<=n;++i)
	{
		int x0 = read(), y0 = read(), d = read();
		int x = x0 + y0, y = x0 - y0;
		a[++ m] = {x, y, i+n};
		a[++ m] = {x-d, y-d, 1};
		a[++ m] = {x-d, y+d+1, -1};
		a[++ m] = {x+d+1, y-d, -1};
		a[++ m] = {x+d+1, y+d+1, 1};
		b[++ k] = y-d, b[++ k] = y+d+1, b[++ k] = y;
	}	
	sort(a+1, a+m+1);
	sort(b+1, b+k+1);
	for (int i=1;i<=k;++i)
		if (vis[b[i]] == 0) vis[b[i]] = ++ cnt;
	for (int i=1;i<=m;++i)
	{
		int y = vis[a[i].y];
		if (a[i].val > n) res[a[i].val - n] = tree.ask(y);
		else tree.add(y, a[i].val);
	}
	for (int i=1;i<=n;++i) printf("%lld ", -- res[i]);
	return 0;
}