hdu 5221 Occupation（树链剖分）

题意：1棵树，3个操作，1.占据从x走到y的路。2。某个点被另一个占据，3.占据以某个点及以下的子树。每次操作都要输出占有权值的和。

1操作就是类似查询的操作，走一遍更新。2操作先看那个点有没有被占据，有才需要更新成没有。3操作，由于树链剖分其实本质就是一个先走重链的dfs序，所以是连续的，就可以区间更新了。

AC代码：

#pragma comment(linker, "/STACK:102400000,102400000")
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdlib>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<ctime>
#include<string.h>
#include<string>
#include<sstream>
#include<bitset>
using namespace std;
#define ll long long
#define ull unsigned long long
#define eps 1e-8
#define NMAX 1000000000
#define MOD 1000000
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI acos(-1)
#define mp make_pair
template<class T>
inline void scan_d(T &ret)
{
    char c;
    int flag = 0;
    ret=0;
    while(((c=getchar())<'0'||c>'9')&&c!='-');
    if(c == '-')
    {
        flag = 1;
        c = getchar();
    }
    while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
    if(flag) ret = -ret;
}
template<class T> inline T Max(T a, T b){ return a > b ? a : b; }
template<class T> inline T Min(T a, T b){ return a < b ? a : b; }
const int maxn = 100000+10;
struct Edge
{
    int v,next;
}e[maxn<<1];
int head[maxn],nct;
int num[maxn],f[maxn],son[maxn],depth[maxn];
int pos[maxn],tree[maxn],top[maxn];
int tot;
int data[maxn];
void add_edge(int u, int v)
{
    e[nct].v = v; e[nct].next = head[u];
    head[u] = nct++;
}

void dfs1(int u, int fa, int dep)
{
    num[u] = 1; f[u] = fa; depth[u] = dep;
    for(int i = head[u]; i != -1; i = e[i].next)
    {
        int v = e[i].v;
        if(v == fa) continue;
        dfs1(v,u,dep+1);
        num[u] += num[v];
        if(!son[u] || num[v] > num[son[u]]) son[u] = v;
    }
}

int subrt[maxn][2];

void dfs2(int u, int tp)
{
    top[u] = tp; tree[u] = ++tot;
    pos[tot] = u;
    subrt[u][0] = tot;
    if(!son[u])
    {
        subrt[u][1] = tot;
        return;
    }
    dfs2(son[u],tp);
    for(int i = head[u]; i != -1; i = e[i].next)
    {
        int v = e[i].v;
        if(v == f[u] || v == son[u]) continue;
        dfs2(v,v);
    }
    subrt[u][1] = tot;
}

struct SegTree
{
    int sum,a;
    bool flag;
}T[maxn<<2];

void build(int l, int r, int rt)
{
    T[rt].a = T[rt].flag = 0;
    if(l == r)
    {
        T[rt].sum = data[pos[l]];
        return;
    }
    int mid = (l+r)>>1;
    build(lson);
    build(rson);
    T[rt].sum = T[rt<<1].sum+T[rt<<1|1].sum;
}

void pushdown(int rt)
{
    if(T[rt].flag)
    {
        T[rt<<1].a = T[rt<<1].sum;
        T[rt<<1|1].a = T[rt<<1|1].sum;
        T[rt<<1].flag = T[rt<<1|1].flag = 1;
        T[rt].flag = 0;
    }
}

void update(int L, int R, int l, int r, int rt)
{
    if(L <= l && R >= r)
    {
        T[rt].a = T[rt].sum;
        T[rt].flag = 1;
        return;
    }
    pushdown(rt);
    int mid = (l+r)>>1;
    if(L <= mid) update(L,R,lson);
    if(R > mid) update(L,R,rson);
    T[rt].a = T[rt<<1].a+T[rt<<1|1].a;
}

void update2(int L, int l, int r, int rt)
{
    if(l == r)
    {
        T[rt].a = 0;
        return;
    }
    pushdown(rt);
    int mid = (l+r)>>1;
    if(L <= mid) update2(L,lson);
    else update2(L,rson);
    T[rt].a = T[rt<<1].a+T[rt<<1|1].a;
}

int query(int L, int R, int l, int r, int rt)
{
    if(L <= l && R >= r) return T[rt].a;
    pushdown(rt);
    int mid = (l+r)>>1,ret = 0;
    if(L <= mid) ret += query(L,R,lson);
    if(R > mid) ret += query(L,R,rson);
    return ret;
}

void upit(int x, int y)
{
    int t1 = top[x],t2 = top[y];
    while(t1 != t2)
    {
        if(depth[t1] < depth[t2])
        {
            swap(t1,t2);
            swap(x,y);
        }
        update(tree[t1],tree[x],1,tot,1);
        x = f[t1]; t1 = top[x];
    }
    if(depth[x] < depth[y]) update(tree[x],tree[y],1,tot,1);
    else update(tree[y],tree[x],1,tot,1);
}

int main()
{
#ifdef GLQ
    freopen("input.txt","r",stdin);
//    freopen("o.txt","w",stdout);
#endif
    int cas,n,q;
    scanf("%d",&cas);
    while(cas--)
    {
        memset(head,-1,sizeof(head));
        memset(son,0,sizeof(son));
        nct = 0;
        tot = 0;
        scanf("%d",&n);
        for(int i = 1; i <= n; i++)
            scanf("%d",&data[i]);
        for(int i = 1; i < n; i++)
        {
            int u,v;
            scanf("%d%d",&u,&v);
            add_edge(u,v);
            add_edge(v,u);
        }
        dfs1(1,1,1);
        dfs2(1,1);
        build(1,tot,1);
        scanf("%d",&q);
        while(q--)
        {
            int op,a,b,x;
            scanf("%d",&op);
            if(op == 1)
            {
                scanf("%d%d",&a,&b);
                upit(a,b);
                printf("%d\n",T[1].a);
            }
            else if(op == 2)
            {
                scanf("%d",&x);
                if(query(tree[x],tree[x],1,tot,1) != 0) update2(tree[x],1,tot,1);
                printf("%d\n",T[1].a);
            }
            else
            {
                scanf("%d",&x);
                update(subrt[x][0],subrt[x][1],1,tot,1);
                printf("%d\n",T[1].a);
            }
        }
    }
    return 0;
}