[题解]LuoGu3066：[USACO12DEC]逃跑的BarnRunning Away From…

原题传送门
此题简直一眼倍增//
对于每个点，往上倍增跳，找到那个最远的与自己距离小于等于l的点
那么这个点可以对自己到那个跳到的点那一段链上的点1的贡献

现在的问题是如何把自己和上面满足要求的最远的点之间一段点的答案都加上1
其实很简单，如果是一段序列上，区间加同一个数，然后最终单点求值是用差分数组做的
那么这道题我们就用树上差分（默认你会树上差分）即可，最终dfs一遍统计一下就好了

Code：

#include <bits/stdc++.h>
#define maxn 200010
#define LL long long
using namespace std;
struct Edge{
    int to, next;
}edge[maxn << 1];
int head[maxn], num, power[maxn], fa[maxn][25], n;
LL len[maxn][25], L;

inline LL read(){
    LL s = 0, w = 1;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
    for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
    return s * w;
}

void add_edge(int x, int y){ edge[++num].to = y; edge[num].next = head[x]; head[x] = num; }

void dfs(int u){
    for (int i = head[u]; i; i = edge[i].next){
        int v = edge[i].to;
        if (v != fa[u][0]){
            dfs(v);
            power[u] += power[v];
        }
    }
}

int main(){
    n = read(), L = read();
    for (int i = 2; i <= n; ++i){
        int u = read(); LL l = read();
        len[i][0] = l, fa[i][0] = u;
        add_edge(u, i); add_edge(i, u);
    }
    for (int j = 1; j <= 20; ++j)
    for (int i = 1; i <= n; ++i)
        fa[i][j] = fa[fa[i][j - 1]][j - 1], len[i][j] = len[i][j - 1] + len[fa[i][j - 1]][j - 1];
    for (int i = 1; i <= n; ++i){
        LL x = L; int u = i;
        for (int j = 20; j >= 0; --j) if (fa[u][j] && x >= len[u][j]) x -= len[u][j], u = fa[u][j];
        ++power[i], --power[fa[u][0]];
    }
    dfs(1);
    for (int i = 1; i <= n; ++i) printf("%d\n", power[i]);
    return 0;
}

其实个人认为这道题非常不错，因为我最近在练主席树，看标签进来的，然后思考了一下主席树做法
每个点有一个深度（加边权的）
对于一个点u，若它的子树中有一个点v，可以给u贡献一个答案，需要满足dep[u]+l>=dep[v]
发现对于每个固定的点u，dep[u]+l为定值，所以只要查找子树中dep小于等于dep[u]+l的点有几个
用树上的主席树可以完成

Code：

#include <bits/stdc++.h>
#define maxn 200010
#define inf 2147483647
#define LL long long
using namespace std;
struct Seg{
	int l, r, sum;
}seg[maxn << 5];
struct Edge{
	int to, next;
	LL len;
}edge[maxn << 1];
int head[maxn], num, cnt, st[maxn], en[maxn], sz, n, p, q, rt[maxn];
LL L, a[maxn], b[maxn];

inline LL read(){
	LL s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

void add_edge(int x, int y, LL z){ edge[++num].to = y, edge[num].len = z, edge[num].next = head[x], head[x] = num; }

void dfs(int u, int pre, LL len){
	a[st[u] = ++cnt] = len, b[cnt] = len;
	for (int i = head[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if (v != pre) dfs(v, u, len + edge[i].len);
	}
	en[u] = cnt;
}

void build(int &rt, int l, int r){
	rt = ++sz;
	seg[rt].sum = 0;
	if (l == r) return;
	int mid = (l + r) >> 1;
	build(seg[rt].l, l, mid); build(seg[rt].r, mid + 1, r);
}

int update(int o, int l, int r){
	int oo = ++sz;
	seg[oo] = seg[o]; ++seg[oo].sum;
	if (l == r) return oo;
	int mid = (l + r) >> 1;
	if (mid >= p) seg[oo].l = update(seg[oo].l, l, mid); else
	seg[oo].r = update(seg[oo].r, mid + 1, r);
	return oo;
}

int query(int u, int v, int l, int r){
	if (r < p) return seg[v].sum - seg[u].sum;
	if (l >= p) return 0;
	int mid = (l + r) >> 1;
	if (mid >= p) return query(seg[u].l, seg[v].l, l, mid); else
	return query(seg[u].r, seg[v].r, mid + 1, r) + seg[seg[v].l].sum - seg[seg[u].l].sum;
}

int main(){
	n = read(), L = read();
	for (int i = 2; i <= n; ++i){
		int x = read(); LL y = read();
		add_edge(x, i, y);
	}
	dfs(1, 0, 0);
	sort(b + 1, b + 1 + n);
	q = unique(b + 1, b + 1 + n) - b - 1;
	build(rt[0], 1, q);
	for (int i = 1; i <= n; ++i){
		p = lower_bound(b + 1, b + 1 + q, a[i]) - b;
		rt[i] = update(rt[i - 1], 1, q);
	}
	b[q + 1] = inf;
	for (int i = 1; i <= n; ++i){
		p = upper_bound(b + 1, b + 1 + q + 1, a[st[i]] + L) - b;
		printf("%d\n", query(rt[st[i] - 1], rt[en[i]], 1, q));
	}
	return 0;
}