第五届CCPC中国大学生程序设计竞赛河南省赛-C

 

思路：离散化+主席树

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
#define N 300003
#define mid (l+r>>1)
#define lc (tr[d].ld)
#define rc (tr[d].rd)
typedef long long ll;

int mx, k, val[N], bit[N], cnt;
int ro[N/3], tot, tid;
ll ans[N/3];
vector<int>V[N/3];

struct Tr{
	int ld, rd;
    int	c;
}tr[N*40];

int newTr() {
	tr[++tot].c = 0;
	tr[tot].ld = tr[tot].rd = -1;
	return tot;
}

void push(int d) {
	tr[d].c = tr[lc].c+tr[rc].c;
}

int build(int l, int r) {
	int d = newTr();
	if (l != r) {
		tr[d].ld = build(l, mid);
		tr[d].rd = build(mid+1, r);
		push(d);
	}
	return d;
}

int update(int l, int r, int pos, int ad, int pre) {
	int d = newTr();
	tr[d].c = tr[pre].c+ad;
	if (l != r) {
		if (pos <= mid) {
			tr[d].ld = update(l, mid, pos, ad, tr[pre].ld);
			tr[d].rd = tr[pre].rd;
		} else {
			tr[d].rd = update(mid+1, r, pos, ad, tr[pre].rd);
			tr[d].ld = tr[pre].ld;
		}
		push(d);
	}
	return d;
}

int query(int l, int r, int L, int R, int rt, int lt) {
	if (l == L && r == R) {
		return tr[rt].c-tr[lt].c;
	}
	if (R <= mid) return query(l, mid, L, R, tr[rt].ld, tr[lt].ld);
	else if (L > mid) return query(mid+1, r, L, R, tr[rt].rd, tr[lt].rd);
	else return query(l, mid, L, mid, tr[rt].ld, tr[lt].ld)+query(mid+1, r, mid+1, R, tr[rt].rd, tr[lt].rd);
}

ll dfs(int u) {
	int rk = lower_bound(bit+1, bit+cnt, val[u])-bit;
	int st = ++tid;
	ro[st] = update(1, cnt, rk, 1, ro[st-1]);
	int i, v;
	ans[u] = 0;
	for (i = 0;i < V[u].size();i++) {
		v = V[u][i];
		ans[u] += dfs(v);
	}
	int l, r;
	l = lower_bound(bit+1, bit+cnt, max(0,val[u]-k))-bit;
	r = lower_bound(bit+1, bit+cnt, min(mx, val[u]+k))-bit;
	ans[u] += query(1, cnt, l, r, ro[tid], ro[st-1]);
	return ans[u];
}

int main() {
	int i, j, n;
	while(~scanf("%d%d", &n, &k)) {
		cnt = 0;
		mx = 0;
		for (i = 1;i <= n;i++) {
			scanf("%d", val+i);
			mx = max(val[i], mx);
			V[i].clear();
		}
		for (i = 1;i <= n;i++) {
			bit[++cnt] = val[i];
			bit[++cnt] = max(0, val[i]-k);
			bit[++cnt] = min(mx, val[i]+k);
		}
		for (i = 2;i <= n;i++) {
			scanf("%d", &j);
			V[j].push_back(i);
		}
		sort(bit+1, bit+1+cnt);
		cnt = unique(bit+1, bit+1+cnt) - bit - 1;
		tot = tid = 0;
		ro[0] =	build(1, cnt);
		dfs(1);
		for (i = 1;i <= n;i++) printf("%lld\n", ans[i]);
	}
}