Housewife Wind（边权树链剖分）

Housewife Wind

http://poj.org/problem?id=2763

Time Limit: 4000MS		Memory Limit: 65536K
Total Submissions: 14820		Accepted: 4097

Description

After their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their ordinary happy life. People in XX Village lived in beautiful huts. There are some pairs of huts connected by bidirectional roads. We say that huts in the same pair directly connected. XX Village is so special that we can reach any other huts starting from an arbitrary hut. If each road cannot be walked along twice, then the route between every pair is unique.

Since Jiajia earned enough money, Wind became a housewife. Their children loved to go to other kids, then make a simple call to Wind: 'Mummy, take me home!'

At different times, the time needed to walk along a road may be different. For example, Wind takes 5 minutes on a road normally, but may take 10 minutes if there is a lovely little dog to play with, or take 3 minutes if there is some unknown strange smell surrounding the road.

Wind loves her children, so she would like to tell her children the exact time she will spend on the roads. Can you help her?

Input

The first line contains three integers n, q, s. There are n huts in XX Village, q messages to process, and Wind is currently in hut s. n < 100001 , q < 100001.

The following n-1 lines each contains three integers a, b and w. That means there is a road directly connecting hut a and b, time required is w. 1<=w<= 10000.

The following q lines each is one of the following two types:

Message A: 0 u 
A kid in hut u calls Wind. She should go to hut u from her current position. 
Message B: 1 i w 
The time required for i-th road is changed to w. Note that the time change will not happen when Wind is on her way. The changed can only happen when Wind is staying somewhere, waiting to take the next kid. 

Output

For each message A, print an integer X, the time required to take the next child.

Sample Input

3 3 1
1 2 1
2 3 2
0 2
1 2 3
0 3

Sample Output

1
3

Source

POJ Monthly--2006.02.26,zgl & twb

 

边权树链剖分模板题

比较一条边上哪个点的深度大，就把权值加在哪个点上

 #include<iostream>
 #include<cstring>
 #include<string>
 #include<cmath>
 #include<cstdio>
 #include<algorithm>
 #include<vector>
 #define maxn 200005
 #define MAXN 200005
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 using namespace std;

 long long tree[maxn<<];
 int n;
 int v[maxn],val[maxn];
 int dep[maxn],fa[maxn],siz[maxn],son[maxn],id[maxn],top[maxn],cnt;
 int co,head[MAXN];
 struct Edge {
     int to, next;
 }edge[MAXN];
 struct E {
     int u, v, c;
 }e[MAXN];
 void addedge(int u, int v) {
     edge[cnt].to = v;
     edge[cnt].next = head[u];
     head[u] = cnt++;
 }
 struct sair{
     int x,y,len;
 }p[maxn];

 void pushup(int rt){
     tree[rt]=(tree[rt<<]+tree[rt<<|]);
 }

 void build(int l,int r,int rt){
     if(l==r){
         tree[rt]=;
         return;
     }
     int mid=(l+r)/;
     build(lson);
     build(rson);
     pushup(rt);
 }

 void add(int L,int R,int k,int l,int r,int rt){
     if(L<=l&&R>=r){
         tree[rt]=k;
         return;
     }
     int mid=(l+r)/;
     if(L<=mid) add(L,R,k,lson);
     if(R>mid) add(L,R,k,rson);
     pushup(rt);
 }

 long long query(int L,int R,int l,int r,int rt){
     if(L<=l&&R>=r){
         return tree[rt];
     }
     int mid=(l+r)/;
     long long ans=;
     if(L<=mid) ans+=query(L,R,lson);
     if(R>mid) ans+=query(L,R,rson);
     pushup(rt);
     return ans;
 }

 void dfs1(int now,int f,int deep){
     dep[now]=deep;
     siz[now]=;
     fa[now]=f;
     int maxson=-;
     for(int i=head[now];~i;i=edge[i].next){
         if(edge[i].to != fa[now]) {
             dfs1(edge[i].to,now,deep+);
             siz[now]+=siz[edge[i].to];
             if(siz[edge[i].to]>maxson){
                 maxson=siz[edge[i].to];
                 son[now]=edge[i].to;
             }
         }
     }
 }

 void dfs2(int now,int topp){
     id[now]=++cnt;
     val[cnt]=v[now];
     top[now]=topp;
     if(!son[now]) return;
     dfs2(son[now],topp);
     for(int i=head[now];~i;i=edge[i].next){
         int vvv = edge[i].to;
         if(vvv==son[now]||vvv==fa[now]) continue;
         dfs2(vvv,vvv);
     }
 }

 long long qRange(int x,int y){
     int t1 = top[x], t2 = top[y];
     long long res = ;
     while(t1 != t2) {
         if(dep[t1] < dep[t2]) {
             swap(t1, t2); swap(x, y);
         }
         res += query(id[t1], id[x], , n, );
         x = fa[t1]; t1 = top[x];
     }
     if(x == y) return res;
     if(dep[x] > dep[y]) swap(x, y);
     return res + query(id[son[x]], id[y], , n, );
 }

 void addRange(int x,int y,int k){
     while(top[x]!=top[y]){
         if(dep[top[x]]<dep[top[y]]) swap(x,y);
         add(id[top[x]],id[x],k,,n,);
         x=fa[top[x]];
     }
     if(dep[x]>dep[y]) swap(x,y);
     add(id[x],id[y],k,,n,);
 }

 int main(){
     int m,r;
     scanf("%d %d %d",&n,&m,&r);
     memset(head, -, sizeof head);
     int pos,z,x,y;
     co=;
     for(int i=;i<n;i++){
         scanf("%d %d %d",&p[i].x,&p[i].y,&p[i].len);
         addedge(p[i].x,p[i].y);
         addedge(p[i].y,p[i].x);
     }
     cnt=;
     int xx;
     dfs1(,,);
     dfs2(,);
     build(,n,);
     for(int i=;i<n;i++){
         if(dep[p[i].x]<dep[p[i].y]) xx=p[i].y;
         else xx=p[i].x;
         addRange(xx,xx,p[i].len);
     }
     for(int i=;i<=m;i++){
         scanf("%d %d",&pos,&x);
         if(!pos){
             printf("%lld\n",qRange(x,r));
             r=x;
         }
         else if(pos){
             scanf("%d",&y);
             p[x].len=y;
             if(dep[p[x].x]<dep[p[x].y]) xx=p[x].y;
             else xx=p[x].x;
             addRange(xx,xx,p[x].len);
         }
     }

 }