4817: [Sdoi2017]树点涂色

lct套线段树

c++代码如下：

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x; i <= y; ++ i)
#define repd(i,x,y) for(register int i = x; i >= y; -- i)
typedef long long ll;
using namespace std;
template<typename T>inline void read(T&x)
{
    x = 0;char c;int sign = 1;
    do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
    do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}

const int N = 1e5 +50;
int n,m,sz,p[N],g[N],top[N],id[N],idx[N],size[N],hson[N],deep[N];

struct Segment_Tree
{
    int val[N << 2],lzy[N << 2];

    inline void put_down(int id)
    {
        if(0 == lzy[id]) return;
        val[id << 1] += lzy[id];
        val[id << 1|1] += lzy[id];
        lzy[id << 1] += lzy[id];
        lzy[id << 1|1] += lzy[id];
        lzy[id] = 0;
    }

    void build(int id,int l,int r)
    {
        if(l == r) return void(val[id] = g[idx[l]]);
        int mid = l + r >> 1;
        build(id << 1,l,mid);
        build(id << 1 | 1,mid + 1,r);
        val[id] = max(val[id << 1],val[id << 1 | 1]);
    }

    void update(int id,int l,int r,int L,int R,int w)
    {
        if( l == L && r == R)
        {
            val[id] += w;
            lzy[id] += w;
            return ;
        }
        int mid = l + r >> 1;
        put_down(id);
        if( L > mid) update(id<<1|1,mid+1,r,L,R,w);
        else if(R <= mid) update(id<<1,l,mid,L,R,w);
        else update(id<<1,l,mid,L,mid,w),update(id<<1|1,mid+1,r,mid+1,R,w);
        val[id] = max(val[id<<1],val[id<<1|1]);
    }

    int qans(int id,int l,int r,int L,int R)
    {
        if( l == L && r == R) return val[id];
        int mid = l + r >> 1;
        put_down(id);
        if( L > mid) return qans(id<<1|1,mid+1,r,L,R);
        else if(R <= mid) return qans(id<<1,l,mid,L,R);
        return max(qans(id<<1,l,mid,L,mid),qans(id<<1|1,mid+1,r,mid+1,R));
    }

    int query(int id,int l,int r,int pos)
    {
        if(l == r) return val[id];
        put_down(id);
        int mid = l + r>> 1;
        if(pos <= mid) return query(id<<1,l,mid,pos);
        else return query(id<<1|1,mid+1,r,pos);
    }

}seg; 

struct Link_Cut_Tree
{
    int f[N];
    int ch[N][2];

    #define lc ch[x][0]
    #define rc ch[x][1]

    inline bool get(int x) { return ch[f[x]][1] == x; }

    inline bool is_root(int x) { return (ch[f[x]][1] != x) && (ch[f[x]][0] != x); }

    inline void rotate(int x)
    {
        int fa = f[x],t = get(x);
        if(!is_root(fa)) ch[f[fa]][get(fa)] = x;
        f[x] = f[fa]; ch[fa][t] = ch[x][t^1];
        if(ch[fa][t]) f[ch[fa][t]] = fa;
        ch[x][t^1] = fa; f[fa] = x;
    }

    inline void splay(int x)
    {
        while(!is_root(x))
        {
            if(!is_root(f[x])) rotate(get(x) == get(f[x]) ? f[x] : x);
            rotate(x);
        }
    }

    void access(int x)
    {
        int t = 0;
        while(x)
        {
            splay(x);

            if(ch[x][1])
            {
                int y = ch[x][1];
                while(ch[y][0]) y = ch[y][0];
                seg.update(1,1,n,id[y],id[y] + size[y] - 1,1);
            }

            if(t)
            {
                int y = t;
                while(ch[y][0]) y = ch[y][0];
                seg.update(1,1,n,id[y],id[y] + size[y] - 1,-1);
            }

            rc = t;
            t = x;
            x = f[x];
        }
    }

}lct;

int head[N],to[N << 1],nxt[N << 1],tot;
inline void add(int x,int y)
{
    to[tot] = y;
    nxt[tot] = head[x];
    head[x] = tot ++;
}

void dfs1(int x)
{
    size[x] = 1;++g[x];
    for(register int i = head[x];~i;i = nxt[i])
        if(to[i] != p[x])
        {
            g[to[i]] += g[x];
            deep[to[i]] = deep[x] + 1;
            p[to[i]] = lct.f[to[i]] = x;
            dfs1(to[i]);
            size[x] += size[to[i]];
            if(size[hson[x]] < size[to[i]])
                hson[x] = to[i];
        }
}

void dfs2(int x,int t)
{
    top[x] = t;
    id[x] = ++ sz; idx[sz] = x;
    if(hson[x]) dfs2(hson[x],t);
    for(register int i = head[x];~i;i = nxt[i])
        if(to[i] != p[x] && to[i] != hson[x])
            dfs2(to[i],to[i]);
}

int lca(int x,int y)
{
    while(top[x] != top[y])
    {
        if(deep[top[x]] < deep[top[y]]) swap(x,y);
        x = p[top[x]];
    }
    if(deep[x] > deep[y]) swap(x,y);
    return x;
}

int main()
{
    memset(head,-1,sizeof head);
    read(n); read(m);
    rep(i,2,n)
    {
        int u,v;
        read(u); read(v);
        add(u,v); add(v,u);
    }

    dfs1(1);
    dfs2(1,1);
    seg.build(1,1,n);

    int op,a,b;
    rep(i,1,m)
    {
        read(op);
        if(op == 1)
        {
            read(a);
            lct.access(a);
        }else if(op == 2)
        {
            read(a); read(b);
            printf("%d\n",seg.query(1,1,n,id[a]) + seg.query(1,1,n,id[b]) - 2*seg.query(1,1,n,id[lca(a,b)]) + 1);
        }else if(op == 3)
        {
            read(a);
            printf("%d\n",seg.qans(1,1,n,id[a],id[a] + size[a] - 1));
        }
    }
    return 0;
}