CodeForces 343D Water Tree （树链剖分+线段树）

题意：一棵树有N个节点，有三种操作（1）“1 v"，表示将以点v为根节点的子树全部赋值为1，（2）“2 v”，表示将点v以及点v的所有祖先节点全部赋值为0，（3）“3 v”，表示查询点v的值。

题解：树链剖分+线段树
操作1：通过dfs序确定节点位置，然后用线段树成段更新。
操作2：树链剖分，更新自己及祖先。
操作3：线段树单点查询。

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;

const int MAXN = 5e5 + 5;
int sum[MAXN << 2], add[MAXN << 2];
int head[MAXN << 1], pre[MAXN], id[MAXN];
int siz[MAXN], son[MAXN], fa[MAXN];
int dep[MAXN], top[MAXN];
struct edge {
    int to;
    int next;
}e[MAXN << 1];
int tot, sign;
/*------------准备阶段--------------*/
void init() {
    memset(head, -1, sizeof(head));
    tot = sign = 0;
}
void addedge(int u, int v) {
    e[tot].to = v, e[tot].next = head[u], head[u] = tot++;
}
/*--------------dfs-----------------*/
void dfs1(int u, int f) {    //1 0
    dep[u] = dep[f] + 1;
    fa[u] = f;
    siz[u] = 1;
    for (int i = head[u]; i != -1; i = e[i].next) {
        int to = e[i].to;
        if (to == f) continue;
        dfs1(to, u);
        siz[u] += siz[to];
        if (siz[to] > siz[son[u]]) son[u] = to;
    }
}
void dfs2(int u, int Top) {  //1 1
    id[u] = ++sign;
    pre[sign] = u;
    top[u] = Top;
    if (son[u]) dfs2(son[u], Top);
    for (int i = head[u]; i != -1; i = e[i].next) {
        int to = e[i].to;
        if (to == son[u] || to == fa[u]) continue;
        dfs2(to, to);
    }
}
/*--------------线段树--------------*/
struct Node {
    int l, r;
    int mid() { return (l + r) >> 1; }
} tree[MAXN << 2];
void PushDown(int rt, int m) {
    if (~add[rt]) {
        add[rt << 1] = add[rt];
        add[rt << 1 | 1] = add[rt];
        sum[rt << 1] = add[rt] * (m - (m >> 1));
        sum[rt << 1 | 1] = add[rt] * (m >> 1);
        add[rt] = -1;
    }
}
void build(int l, int r, int rt) {
    tree[rt].l = l;
    tree[rt].r = r;
    add[rt] = -1;
    sum[rt] = 0;
    if (l == r) {
        //sum[rt] = 0;
        return;
    }
    int m = tree[rt].mid();
    build(l, m, rt << 1);
    build(m + 1, r, rt << 1 | 1);
    //sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}
void update(int c, int l, int r, int rt) {
    if (tree[rt].l == l && r == tree[rt].r) {
        add[rt] = c;
        sum[rt] = c * (r - l + 1);
        return;
    }
    if (tree[rt].l == tree[rt].r) return;
    PushDown(rt, tree[rt].r - tree[rt].l + 1);
    int m = tree[rt].mid();
    if (r <= m) update(c, l, r, rt << 1);
    else if (l > m) update(c, l, r, rt << 1 | 1);
    else {
        update(c, l, m, rt << 1);
        update(c, m + 1, r, rt << 1 | 1);
    }
    sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}
int query(int pos, int rt) {
    if (tree[rt].l == tree[rt].r) {
        return sum[rt];
    }
    PushDown(rt, tree[rt].r - tree[rt].l + 1);
    int m = tree[rt].mid();
    int res = 0;
    if (pos <= m) res = query(pos, rt << 1);
    else res = query(pos, rt << 1 | 1);
    return res;
}
/*------------树链剖分-------------*/
void solve(int x, int y) {
    while (top[x] != top[y]) {
        if (dep[top[x]] < dep[top[y]]) swap(x, y);
        update(0, id[top[x]], id[x], 1);
        x = fa[top[x]];
    }
    if (id[x] > id[y]) swap(x, y);
    update(0, id[x], id[y], 1);
}
int n, m, u, v, ind, x;
int main() {
    init();
    scanf("%d", &n);
    for (int i = 1; i <= n - 1; i++) {
        scanf("%d%d", &u, &v);
        addedge(u, v);
        addedge(v, u);
    }
    dfs1(1, 0);
    dfs2(1, 1);
    build(1, n, 1);
    scanf("%d", &m);
    while (m--) {
        scanf("%d%d", &ind, &x);
        if (ind == 1) update(1, id[x], id[x] + siz[x] - 1, 1);
        else if (ind == 2) solve(1, x);
        else printf("%d\n", query(id[x], 1));
    }
    return 0;
}