Whistle's New Car Gym - 101147J

https://cn.vjudge.net/problem/Gym-101147J

j在i的子树是j在下层的节点！

思路：树上差分 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=5e5+9;
const int mod=1e9+7;

ll x[maxn];
struct E
{
    int to;
    ll w;
    int nex;
}edge[maxn<<1];
int tot;
int head[maxn];
void addedge(int u,int v,ll w)
{
    edge[tot].to=v;
    edge[tot].w=w;
    edge[tot].nex=head[u];
    head[u]=tot++;
}

bool vis[maxn];

struct F
{
    ll w;
    int to;
}fa[maxn][35];

void dfs1(int u,int f)
{
    vis[u]=1;
    fa[u][0].to=f;
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        ll w=edge[i].w;
        if(vis[v]) continue;
        if(v==f) continue;
        fa[v][0].w=w;
        dfs1(v,u);
    }
}

int ans[maxn];

void dfs2(int u,int f)
{
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        if(v==f) continue;
        dfs2(v,u);
    }

    ans[fa[u][0].to]++;
    //cout<<fa[u][0].to<<" ";
    ll tmp=x[u];
    for(int j=30;j>=0;j--)
    {
        if(tmp>=fa[u][j].w)
        {
            tmp-=fa[u][j].w;
            u=fa[u][j].to;
        }
    }
    //cout<<fa[u][0].to<<endl;
    ans[fa[u][0].to]--;
}

void dfs3(int u,int f)
{
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        if(v==f) continue;
        dfs3(v,u);
        ans[u]+=ans[v];
    }
}

void init()
{
    mem(vis,0);
    mem(head,-1);
    mem(ans,0);
    tot=0;
}

int main()
{
    FAST_IO;

    //freopen("input.txt","r",stdin);
    freopen("car.in","r",stdin);

    int T;
    cin>>T;
    while(T--)
    {
        init();

        int n;
        cin>>n;
        for(int i=1;i<=n;i++) cin>>x[i];

        for(int i=1;i<=n-1;i++)
        {
            int u,v;
            ll w;
            cin>>u>>v>>w;
            addedge(u,v,w);
            addedge(v,u,w);
        }

        fa[1][0].to=0;
        dfs1(1,0);
        for(int j=1;j<=30;j++)
        {
            for(int i=1;i<=n;i++)
            {
                fa[i][j].to=fa[fa[i][j-1].to][j-1].to;
                fa[i][j].w=fa[i][j-1].w+fa[fa[i][j-1].to][j-1].w;
            }
        }

//        for(int i=1;i<=n;i++)
//        {
//            for(int j=0;j<=4;j++)
//            {
//                cout<<i<<" "<<fa[i][j].to<<" "<<fa[i][j].w<<endl;
//            }
//        }

        dfs2(1,0);

        dfs3(1,0);

        for(int i=1;i<=n;i++)
        {
            if(i!=1) cout<<" ";
            cout<<ans[i];
        }
        cout<<endl;

    }


    return 0;
}