[HAOI2015]树上操作 【树链剖分】

[HAOI2015]树上操作

卡我的居然是线段树，orz，尝试了各种lazy标记终于A了

这道题好像比树链剖分的模板题还简单

其实感觉树剖并不难理解，核心就是两次dfs,第一次分轻重链，第二次处理各种与编号有关的东西，处理完之后以某一结点u为根的子树就是id[u]~id[u]+siz[u]-1的节点，u到这条链的顶点的节点就是id[top[u]]~id[u]这些点，所以就很好处理了

对于本题的3操作 只要不断往回，把结点到根经过的所有链都找到就好了

代码

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#define ll long long 
#define lo o<<1
#define ro o<<1|1
#define mid ((l+r)>>1)
using namespace std;
const ll N=100010;
ll n, m, rt, w[N];
ll top[N], fa[N], id[N], real[N], hson[N], siz[N], tot;
ll head[N<<4], to[N<<4], next[N<<4], now;
ll sum[N<<4], laz[N<<4];
void add(ll u, ll v){to[++now]=v; next[now]=head[u]; head[u]=now; to[++now]=u; next[now]=head[v]; head[v]=now;}

//线段树
void pushup(ll o) {sum[o]=sum[lo]+sum[ro];}
void pushdown(ll o, ll l, ll r) 
{
    if(!laz[o]) return ;
    laz[lo]+=laz[o], laz[ro]+=laz[o];
    sum[lo]+=laz[o]*(mid-l+1), sum[ro]+=laz[o]*(r-mid);
    laz[o]=0;
}

void build(ll o, ll l, ll r)
{
    sum[o]=laz[o]=0; if(l == r) {sum[o]=w[real[l]]; return ;}
    build(lo, l, mid); build(ro, mid+1, r); pushup(o);
}
void updata1(ll o, ll l, ll r, ll L, ll R, ll x)
{
    pushdown(o, l, r); if(l > R || r < L) return ;if(l >= L && r <= R) {laz[o]+=x, sum[o]+=x*(r-l+1); return ;}
    updata1(lo, l, mid, L, R, x); updata1(ro, mid+1, r, L, R, x); pushup(o);
}
void updata2(ll o, ll l, ll r, ll X, ll x)
{
    pushdown(o, l, r); if(X > r || X < l) return; if(l == r) {sum[o]+=x; return ;}
    updata2(lo, l, mid, X, x); updata2(ro, mid+1, r, X, x); pushup(o);
}

ll query(ll o, ll l, ll r, ll L, ll R)
{
    pushdown(o, l, r); if(l > R || r < L) return 0;if(l >= L && r <= R) return sum[o];
    return query(lo, l, mid, L, R)+query(ro, mid+1, r, L, R); 
}

//树链剖分
void dfs1(ll u, ll f)
{
    fa[u]=f, siz[u]=1; ll v;
    for(int i=head[u]; i; i=next[i]) if((v=to[i]) != fa[u]) 
        {dfs1(v, u); siz[u]+=siz[v]; if(!hson[u] || siz[v] > siz[hson[u]]) hson[u]=v;}
}

void dfs2(ll u, ll anc)
{
    top[u]=anc; id[u]=++tot; real[tot]=u; ll v;
    if(!hson[u]) return ; dfs2(hson[u], anc);
    for(int i=head[u]; i; i=next[i]) if((v=to[i]) != fa[u] && v != hson[u]) dfs2(v, v);
}

ll Query(ll x)
{
    ll u=x, tu=top[u], ans=0; 
    while(tu != rt) ans+=query(1, 1, n, id[tu], id[u]), u=fa[tu], tu=top[u];
    ans+=query(1, 1, n, id[tu], id[u]); return ans;
}

int read(){
    int out=0, f=1; char c=getchar(); while(c < '0' || c > '9') {if(c == '-') f=-1; c=getchar();}
    while(c >= '0' && c <= '9') {out=(out<<1)+(out<<3)+c-'0'; c=getchar();}
    return out*f;
}

void solve()
{
    for(int i=1; i <= m; i++)
    {
        int cmd=read(), a=read(), x;
        if(cmd == 1) x=read(), updata2(1, 1, n, id[a], x);
        if(cmd == 2) x=read(), updata1(1, 1, n, id[a], id[a]+siz[a]-1, x);
        if(cmd == 3) printf("%lld\n", Query(a));
    }
}

void init()
{
    n=read(), m=read(); rt=1; int u, v; 
    memset(head, 0, sizeof(head)); memset(next, 0, sizeof(next)); 
    for(int i=1; i <= n; i++) w[i]=read();
    for(int i=1; i < n; i++) u=read(), v=read(), add(u, v);
    dfs1(rt, 0); dfs2(rt, rt); build(1, 1, n);
}

int main()
{
    init(); solve();
    return 0;
}