loj 139 树链剖分

  1 #include<iostream>
  2 #include<cstdio>
  3 #include<cmath>
  4 #include<cstdlib>
  5 #include<cstring>
  6 #include<algorithm>
  7 #include<vector>
  8 #include<queue>
  9 #define inf 2147483648
 10 #define ll long long
 11 #define MAXN 100100
 12 using namespace std;
 13 inline int read()
 14 {
 15     int x=0,f=1;char ch=getchar();
 16     while(!isdigit(ch)) {if(ch==‘-‘) f=-1;ch=getchar();}
 17     while(isdigit(ch)) {x=x*10+ch-‘0‘;ch=getchar();}
 18     return x*f;
 19 }
 20 int n,m,cnt,nxt[MAXN<<1],fst[MAXN],to[MAXN<<1];
 21 int dep[MAXN],sz[MAXN],hsh[MAXN],HSH[MAXN],fa[MAXN],bl[MAXN],rt=1;
 22 ll tag[MAXN<<2],sum[MAXN<<2],val[MAXN];
 23 void add(int u,int v) {nxt[++cnt]=fst[u],fst[u]=cnt,to[cnt]=v;}
 24 void dfs(int x)
 25 {
 26     for(register int i=fst[x];i;i=nxt[i])
 27         if(to[i]!=fa[x]) {dep[to[i]]=dep[x]+1,fa[to[i]]=x;dfs(to[i]);sz[x]+=sz[to[i]];}
 28     sz[x]++;
 29 }
 30 void dfs(int x,int anc)
 31 {
 32     hsh[x]=++cnt,HSH[cnt]=x,bl[x]=anc;int hvs=0;
 33     for(register int i=fst[x];i;i=nxt[i])
 34         if(to[i]!=fa[x]&&sz[to[i]]>sz[hvs]) hvs=to[i];
 35     if(!hvs) return ;dfs(hvs,anc);
 36     for(register int i=fst[x];i;i=nxt[i])
 37         if(to[i]!=fa[x]&&to[i]!=hvs) dfs(to[i],to[i]);
 38 }
 39 void pshd(int k,int l,int r,int mid)
 40 {
 41     sum[k<<1]+=tag[k]*(mid-l+1),sum[k<<1|1]+=tag[k]*(r-mid);
 42     tag[k<<1]+=tag[k],tag[k<<1|1]+=tag[k],tag[k]=0;
 43 }
 44 void mdf(int k,int l,int r,int a,int b,int x)
 45 {
 46     if(l==a&&r==b) {sum[k]+=(ll)x*(r-l+1),tag[k]+=x;return ;}
 47     int mid=l+r>>1;
 48     if(tag[k]) pshd(k,l,r,mid);
 49     if(b<=mid) mdf(k<<1,l,mid,a,b,x);
 50     else if(a>mid) mdf(k<<1|1,mid+1,r,a,b,x);
 51     else {mdf(k<<1,l,mid,a,mid,x);mdf(k<<1|1,mid+1,r,mid+1,b,x);}
 52     sum[k]=sum[k<<1]+sum[k<<1|1];
 53 }
 54 ll query(int k,int l,int r,int a,int b)
 55 {
 56     if(l==a&&r==b) return sum[k];
 57     int mid=l+r>>1;
 58     if(tag[k]) pshd(k,l,r,mid);
 59     if(b<=mid) return query(k<<1,l,mid,a,b);
 60     else if(a>mid) return query(k<<1|1,mid+1,r,a,b);
 61     else return query(k<<1,l,mid,a,mid)+query(k<<1|1,mid+1,r,mid+1,b);
 62 }
 63 inline void workm()
 64 {
 65     int x=read(),c=read();
 66     if(x==rt) {mdf(1,1,n,1,n,c);return ;}ll f,res=0;int y=rt;
 67     if(hsh[x]+sz[x]-1>=hsh[rt]&&hsh[x]<=hsh[rt])
 68     {
 69         while(fa[bl[y]]!=x&&bl[y]!=bl[x]) y=fa[bl[y]];
 70         if(bl[y]==bl[x]) f=hsh[x]+1;else f=hsh[bl[y]];
 71         mdf(1,1,n,1,f-1,c);
 72         if(f+sz[HSH[f]]<=n) mdf(1,1,n,f+sz[HSH[f]],n,c);
 73     }
 74     else mdf(1,1,n,hsh[x],hsh[x]+sz[x]-1,c);
 75 }
 76 inline ll workq(int x)
 77 {
 78     if(x==rt) return sum[1];ll f,res=0;int y=rt;
 79     if(hsh[x]+sz[x]-1>=hsh[rt]&&hsh[x]<=hsh[rt])
 80     {
 81         while(fa[bl[y]]!=x&&bl[y]!=bl[x]) y=fa[bl[y]];
 82         if(bl[y]==bl[x]) f=hsh[x]+1;else f=hsh[bl[y]];
 83         res+=query(1,1,n,1,f-1);
 84         if(f+sz[HSH[f]]<=n) res+=query(1,1,n,f+sz[HSH[f]],n);
 85         return res;
 86     }
 87     else return query(1,1,n,hsh[x],hsh[x]+sz[x]-1);
 88 }
 89 int main()
 90 {
 91     n=read();int a,b,c;ll res=0;
 92     for(register int i=1;i<=n;i++) val[i]=read();
 93     for(register int i=2;i<=n;i++) {b=read();add(i,b);add(b,i);}
 94     fa[1]=1;dfs(1);cnt=0;dfs(1,1);
 95     for(register int i=1;i<=n;i++) mdf(1,1,n,hsh[i],hsh[i],val[i]);
 96     m=read();
 97     for(register int t=1;t<=m;t++)
 98     {
 99         c=read();
100         if(c==1) rt=read();
101         else if(c==2)
102         {
103             a=read(),b=read(),c=read();
104             while(bl[a]!=bl[b])
105             {
106                 if(dep[bl[a]]<dep[bl[b]]) swap(a,b);
107                 mdf(1,1,n,hsh[bl[a]],hsh[a],c);
108                 a=fa[bl[a]];
109             }
110             if(dep[a]>dep[b]) swap(a,b);
111             mdf(1,1,n,hsh[a],hsh[b],c);
112         }
113         else if(c==4)
114         {
115             a=read(),b=read(),res=0;
116             while(bl[a]!=bl[b])
117             {
118                 if(dep[bl[a]]<dep[bl[b]]) swap(a,b);
119                 res+=query(1,1,n,hsh[bl[a]],hsh[a]);
120                 a=fa[bl[a]];
121             }
122             if(dep[a]>dep[b]) swap(a,b);
123             res+=query(1,1,n,hsh[a],hsh[b]);
124             printf("%lld\n",res);
125         }
126         else if(c==3) workm();
127         else printf("%lld\n",workq(read()));
128     }
129 }