天天爱跑步AcWing354 动态开点+权值线段树+树上差分+思维+巨多细节

//#define LOCAL
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
int n , m;
int w[300005];
//前向星
int head[300005], cnt;
struct e{
    int t, next;
}edge[600005];
void add(int f, int t)
{
    edge[cnt].t = t;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
//LCA
int son[300005] , Size[300005], top[300005], fa[300005] , deep[300005];
void dfs1(int u)
{
    Size[u] = 1;
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t;
        if(v != fa[u])
        {
            fa[v] = u;
            deep[v] = deep[u] + 1;
            dfs1(v);
            Size[u] += Size[v];
            if(Size[v] > Size[son[u]])
                son[u] = v;
        }
    }
}
void dfs2(int u, int t)
{
    top[u] = t;
    if(son[u])
        dfs2(son[u],t);
    for(int i = head[u] ; i != -1; i = edge[i].next)
    {
        int v = edge[i].t;
        if(v != son[u] && v != fa[u])
            dfs2(v,v);
    }
}
int LCA(int x , int y)
{
    while(top[x] != top[y])
    {
        if(deep[top[x]] < deep[top[y]])
            swap(x,y);
        x = fa[top[x]];
    }
    return deep[x] > deep[y] ? y : x;
}
//线段树
int lc[300005*40], rc[300005*40], val[300005*40];
int rt[300005] , tot, ans[300005], vis[300005];
void update(int& id , int l , int r, int k , int p)
{
    if(!id) id = ++ tot;
    if(l == r)
    {
        val[id] += p;
        return ;
    }
    int mid = (l + r) >> 1;
    if(k <= mid) update(lc[id], l , mid, k ,p);
    else update(rc[id] , mid + 1, r, k , p);
}
int merge(int x , int y, int l , int r)
{
    if(!x) return y;
    if(!y) return x;
    if(l == r)
        val[x] += val[y];
    else
    {
        int mid = (l + r) >> 1;
        lc[x] = merge(lc[x], lc[y], l, mid);
        rc[x] = merge(rc[x], rc[y], mid + 1, r);
    }
    return x;
}
int query(int id, int l , int r, int k)
{
    if(!id) return 0;
    if(l == r)
        return val[id];
    int mid = (l + r) >> 1;
    if(k <= mid) return query(lc[id], l, mid, k);
    else return query(rc[id], mid + 1 ,r , k);
}
void getans(int u)
{
    vis[u] = 1;
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t;
        if(!vis[v])
        {
            getans(v);
            rt[u] = merge(rt[u],rt[v],1,n<<1);
        }
    }
    //为什么是deep[u] - w[u] + n , 而不是 w[u] - deep[u] + n
    //若w[u] = 2 && deep[u] = 0 ,那么就会很尴尬的算两次，因为+n后会出现值重复类似取模
    if(w[u] && deep[u] + w[u] + n <= 2*n)
        ans[u] += query(rt[u],1,n<<1,deep[u] + w[u] + n);
    ans[u] += query(rt[u],1,n<<1, deep[u] - w[u] + n);
}
int main(void)
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("odata.out", "w", stdout);
#endif
    mem(head,-1);
    scanf("%d %d",&n,&m);
    int u , v;
    for(int i = 1 ; i < n ; i ++)
    {
        scanf("%d %d",&u,&v);
        add(u,v);
        add(v,u);
    }
    dfs1(1);
    dfs2(1,1);
    for(int i = 1 ; i <= n ; i ++)
        scanf("%d",&w[i]);
    for(int i = 1 ; i <= m ; i ++)
    {
        scanf("%d %d",&u,&v);
        int lca = LCA(u,v);
        update(rt[u], 1 , n << 1, deep[u]+n,1);
        update(rt[lca], 1, n << 1, deep[u]+n,-1);
        update(rt[v], 1, n << 1, n + 2 * deep[lca] - deep[u], 1);
        update(rt[fa[lca]], 1, n << 1 , n + 2 * deep[lca] - deep[u], -1);
    }
    getans(1);
    for(int i = 1 ; i <= n ; i ++)
        printf("%d ",ans[i]);
}