BZOJ2836:[SHOI2012]魔法树(树链剖分)

Description

Input

Output

Sample Input

4
0 1
1 2
2 3
4
Add 1 3 1
Query 0
Query 1
Query 2

Sample Output

3
3
2

Solution

退役选手打打板子休闲一下QAQ

居然能1A真是不可思议

Code

 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 #include<algorithm>
 #define N (100000+1000)
 using namespace std;

 struct Edge{int to,next;}edge[N<<];
 struct Node{long long val,add;}Segt[N<<];

 int Depth[N],Father[N],Size[N];
 int T_NUM[N],Top[N],Son[N];
 int head[N],num_edge;
 int x,y,k,n,m,cnt;
 char opt[];

 void add(int u,int v)
 {
     edge[++num_edge].to=v;
     edge[num_edge].next=head[u];
     head[u]=num_edge;
 }

 void Dfs1(int x)
 {
     Depth[x]=Depth[Father[x]]+;
     Size[x]=;
     for (int i=head[x]; i; i=edge[i].next)
         if (edge[i].to!=Father[x])
         {
             Father[edge[i].to]=x;
             Dfs1(edge[i].to);
             Size[x]+=Size[edge[i].to];
             if (!Son[x] || Size[edge[i].to]>Son[x])
                 Son[x]=edge[i].to;
         }
 }

 void Dfs2(int x,int top)
 {
     Top[x]=top;
     T_NUM[x]=++cnt;
     if (Son[x]) Dfs2(Son[x],top);
     for (int i=head[x]; i; i=edge[i].next)
         if (edge[i].to!=Father[x] && edge[i].to!=Son[x])
             Dfs2(edge[i].to,edge[i].to);
 }

 void Pushdown(int now,int l,int r)
 {
     if (Segt[now].add)
     {
         Segt[now<<].add+=Segt[now].add;
         Segt[now<<|].add+=Segt[now].add;
         int mid=(l+r)>>;
         Segt[now<<].val+=Segt[now].add*(mid-l+);
         Segt[now<<|].val+=Segt[now].add*(r-mid);
         Segt[now].add=;
     }
 }

 void Update(int now,int l,int r,int l1,int r1,int k)
 {
     if (r<l1 || l>r1) return;
     if (l1<=l && r<=r1)
     {
         Segt[now].val+=(long long)(r-l+)*k;
         Segt[now].add+=k;
         return;
     }
     Pushdown(now,l,r);
     int mid=(l+r)>>;
     Update(now<<,l,mid,l1,r1,k);
     Update(now<<|,mid+,r,l1,r1,k);
     Segt[now].val=Segt[now<<].val+Segt[now<<|].val;
 }

 long long Query(int now,int l,int r,int l1,int r1)
 {
     if (l1<=l && r<=r1)
         return Segt[now].val;
     Pushdown(now,l,r);
     int mid=(l+r)>>;
     if (r1<=mid) return Query(now<<,l,mid,l1,r1);
     if (l1>=mid+) return Query(now<<|,mid+,r,l1,r1);
     return Query(now<<,l,mid,l1,r1)+Query(now<<|,mid+,r,l1,r1);
 }

 void Change(int x,int y,int k)
 {
     int fx=Top[x],fy=Top[y];
     while (fx!=fy)
     {
         if (Depth[fx]<Depth[fy])
             swap(x,y),swap(fx,fy);
         Update(,,n,T_NUM[fx],T_NUM[x],k);
         x=Father[fx],fx=Top[x];
     }
     if (Depth[x]<Depth[y]) swap(x,y);
     Update(,,n,T_NUM[y],T_NUM[x],k);
 }

 int main()
 {
     scanf("%d",&n);
     for (int i=; i<=n-; ++i)
     {
         scanf("%d%d",&x,&y);
         x++; y++;
         add(x,y); add(y,x);
     }
     Dfs1(); Dfs2(,);
     scanf("%d",&m);
     for (int i=; i<=m; ++i)
     {
         scanf("%s",opt);
         if (opt[]=='A')
         {
             scanf("%d%d%d",&x,&y,&k); x++; y++;
             Change(x,y,k);
         }
         else
         {
             scanf("%d",&x); x++;
             printf("%lld\n",Query(,,n,T_NUM[x],T_NUM[x]+Size[x]-));
         }
     }
 }