可并堆

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 300005
#define LL long long
using namespace std;
struct use{int l,r,d;LL ad,ch;}hp[N];
struct uu{int ai;LL vi,hi;}ci[N];
int rt[N]={0},point[N]={0},next[N],cur[N],zh[N],zt,pa[N],ca[N]={0},dis[N]={0};
LL vi[N];
void pushdown(int x){
    int l,r;l=hp[x].l;r=hp[x].r;
    if (l){
        vi[l]=vi[l]*hp[x].ch+hp[x].ad;
        hp[l].ad=hp[l].ad*hp[x].ch+hp[x].ad;
        hp[l].ch=hp[l].ch*hp[x].ch;
    }if (r){
        vi[r]=vi[r]*hp[x].ch+hp[x].ad;
        hp[r].ad=hp[r].ad*hp[x].ch+hp[x].ad;
        hp[r].ch=hp[r].ch*hp[x].ch;
    }hp[x].ad=0LL;hp[x].ch=1LL;
}
int merge(int x,int y){
    if (!x) return y;
    if (!y) return x;
    pushdown(x);pushdown(y);
    if (vi[x]>vi[y]) swap(x,y);
    hp[x].r=merge(hp[x].r,y);
    if (hp[hp[x].l].d<hp[hp[x].r].d) swap(hp[x].l,hp[x].r);
    if (!hp[x].r) hp[x].d=0;
    else hp[x].d=hp[hp[x].r].d+1;
    return x;}
void work(int u){
    while(rt[u]&&vi[rt[u]]<ci[u].hi){
        ++ca[u];pushdown(rt[u]);
        pa[rt[u]]=dis[pa[rt[u]]]-dis[u];
        rt[u]=merge(hp[rt[u]].l,hp[rt[u]].r);
    }if (u!=1){
        if (rt[u]){
            if (ci[u].ai==0){
                vi[rt[u]]+=ci[u].vi;
                hp[rt[u]].ad+=ci[u].vi;
            }else{
                vi[rt[u]]*=ci[u].vi;
                hp[rt[u]].ad*=ci[u].vi;
                hp[rt[u]].ch*=ci[u].vi;
            }
        }
    }else
        while(rt[u]){
            pushdown(rt[u]);
            pa[rt[u]]=dis[pa[rt[u]]]-dis[u]+1;
            rt[u]=merge(hp[rt[u]].l,hp[rt[u]].r);
        }
}
int main(){
    int n,m,i,fi,u,v;
    scanf("%d%d",&n,&m);
    for (i=1;i<=n;++i) scanf("%I64d",&ci[i].hi);
    for (i=2;i<=n;++i){
        scanf("%d%d%I64d",&fi,&ci[i].ai,&ci[i].vi);
        next[i]=point[fi];cur[fi]=point[fi]=i;
    }for (i=1;i<=m;++i){
        scanf("%I64d%d",&vi[i],&fi);
        pa[i]=fi;
        hp[i]=(use){0,0,0,0LL,1LL};
        rt[fi]=merge(rt[fi],i);
    }zh[zt=1]=1;dis[1]=1;
    while(zt){
        u=zh[zt];
        if ((v=cur[u])>0){
            dis[v]=dis[u]+1;
            zh[++zt]=v;
            cur[u]=next[v];
        }else{
            --zt;
            for (v=point[u];v;v=next[v])
                rt[u]=merge(rt[u],rt[v]);
            work(u);
        }
    }for (i=1;i<=n;++i) printf("%d\n",ca[i]);
    for (i=1;i<=m;++i) printf("%d\n",pa[i]);
}