【左偏树】 [JLOI2015]城池攻占

原来左偏树还可以打tag，get了

和线段树打tag一样，时不时Push_Down就好了

然后这里显然也是要先乘法后加法的

tag打上了之后还是其他一般左偏树差不多，有些细节注意一下

然后开 long long!!!

 #include<bits/stdc++.h>
 #define int long long
 #define writeln(x)  write(x),puts("")
 #define writep(x)   write(x),putchar(' ')
 using namespace std;
 inline int read(){
     int ans=,f=;char chr=getchar();
     while(!isdigit(chr)){if(chr=='-') f=-;chr=getchar();}
     while(isdigit(chr)){ans=(ans<<)+(ans<<)+chr-;chr=getchar();}
     return ans*f;
 }void write(int x){
     if(x<) putchar('-'),x=-x;
     if(x>) write(x/);
     putchar(x%+'');
 }const int M = 3e5+;
 int a[M],h[M],v[M],c[M],n,m,head[M],ver[M<<],nxt[M<<],tot,val[M],son[M][],dis[M],fa[M];
 int mul[M],add[M],dep[M],ans1[M],ans2[M];
 inline void Add(int x,int y){ver[++tot]=y;nxt[tot]=head[x];head[x]=tot;}
 #define ls son[x][0]
 #define rs son[x][1]
 inline void Down(int x,int mull,int addd){
     if(!x) return;
     val[x]*=mull,val[x]+=addd;
     mul[x]*=mull,add[x]*=mull,add[x]+=addd;
 }
 inline void Push_Down(int x){
     Down(ls,mul[x],add[x]);
     Down(rs,mul[x],add[x]);
     mul[x]=,add[x]=;
 }
 int Merge(int x,int y){
     if(!x||!y) return x|y;
     Push_Down(x);Push_Down(y);
     if(val[x]>val[y]) swap(x,y);
     rs=Merge(rs,y);
     if(dis[ls]<dis[rs]) swap(ls,rs);
     dis[x]=dis[rs]+;
     return x;
 }int Pop(int x){return Merge(ls,rs);}
 void dfs(int x){
     for(int i=head[x];i;i=nxt[i]){
         dep[ver[i]]=dep[x]+;
         dfs(ver[i]);
         fa[x]=Merge(fa[x],fa[ver[i]]);
     }
     while(fa[x]&&val[fa[x]]<h[x]){
         Push_Down(fa[x]);
         ans1[x]++;ans2[fa[x]]=dep[c[fa[x]]]-dep[x];
         fa[x]=Pop(fa[x]);
     }if(a[x]) Down(fa[x],v[x],);
     else Down(fa[x],,v[x]);
 }
 signed main(){
     n=read(),m=read();
     for(int i=;i<=n;i++) h[i]=read();
     for(int x,i=;i<=n;i++)    x=read(),Add(x,i),a[i]=read(),v[i]=read();
     for(int i=;i<=m;i++){
         val[i]=read(),c[i]=read(),mul[i]=;
         fa[c[i]]=Merge(fa[c[i]],i);
     }dep[]=,dfs();
     while(fa[]){
         Push_Down(fa[]);
         ans2[fa[]]=dep[c[fa[]]];
         fa[]=Pop(fa[]);
     }
     for(int i=;i<=n;i++) writeln(ans1[i]);
     for(int i=;i<=n;i++) writeln(ans2[i]);
     return ;
 }