[BZOJ2243][[SDOI2011]染色][树链剖分+线段树]

[BZOJ2243][[SDOI2011]染色][树链剖分+线段树]

题目大意：

给定一棵有n个节点的无根树和m个操作，操作有2类：
1、将节点a到节点b路径上所有点都染成颜色c；
2、询问节点a到节点b路径上的颜色段数量（连续相同颜色被认为是同一段），如“112221”由3段组成：“11”、“222”和“1”。
请你写一个程序依次完成这m个操作。

思路：

树链剖分后在线段树上记录一下每个节点表示的区间的最左端的颜色和最右端的颜色。向上合并的时候如果左儿子最右端的颜色和右儿子最左端的颜色相同的话答案－1。

另外统计树链的时候每条链之间相连的地方颜色也要判断一下，相同的话要-1。

代码：

#include <bits/stdc++.h>
using namespace std;
const int Maxn = 100010;

inline char get(void) {
    static char buf[100000], *p1 = buf, *p2 = buf;
    if (p1 == p2) {
        p2 = (p1 = buf) + fread(buf, 1, 100000, stdin);
        if (p1 == p2) return EOF;
    }
    return *p1++;
}
inline void read(int &x) {
    x = 0; static char c;
    for (; !(c >= '0' && c <= '9'); c = get());
    for (; c >= '0' && c <= '9'; x = x * 10 + c - '0', c = get());
}
inline void read(char &x) {
    for (x = get(); !(x >= 'A' && x <= 'Z'); x = get());
}
int n, m;
int head[Maxn], sub;
struct Edge {
    int to, nxt;
    Edge(void) {}
    Edge(const int &to, const int &nxt) : to(to), nxt(nxt) {}
} edge[Maxn << 1];
inline void add(int a, int b) {
    edge[++sub] = Edge(b, head[a]), head[a] = sub;
}

int Size[Maxn], dep[Maxn], fa[Maxn], bel[Maxn], cnt, pos[Maxn], a[Maxn], b[Maxn];
inline void dfs1(int u, int f) {
    Size[u] = 1;
    for (int i = head[u], v; i; i = edge[i].nxt) {
        v = edge[i].to;
        if (v == f) continue;
        fa[v] = u; dep[v] = dep[u] + 1;
        dfs1(v, u);
        Size[u] += Size[v];
    }

}
inline void dfs2(int u, int path) {
    bel[u] = path; pos[u] = ++cnt; b[pos[u]] = a[u];
    int k = 0;
    for (int i = head[u], v; i; i = edge[i].nxt) {
        v = edge[i].to;
        if (dep[v] > dep[u] && Size[v] > Size[k]) k = v;
    }
    if (!k) return;
    dfs2(k, path);
    for (int i = head[u], v; i; i = edge[i].nxt) {
        v = edge[i].to;
        if (dep[v] > dep[u] && v != k) dfs2(v, v);
    }
}

int lc[Maxn << 2], rc[Maxn << 2], kind[Maxn << 2], tag[Maxn << 2];
inline void pushUp(int o) {
    kind[o] = kind[o << 1] + kind[o << 1 | 1];
    if (rc[o << 1] && lc[o << 1 | 1])
        kind[o] -= (rc[o << 1] == lc[o << 1 | 1]);
    lc[o] = lc[o << 1];
    rc[o] = rc[o << 1 | 1];
}
inline void pushDown(int o) {
    if (tag[o]) {
        lc[o << 1] = lc[o << 1 | 1] = tag[o];
        rc[o << 1] = rc[o << 1 | 1] = tag[o];
        tag[o << 1] = tag[o << 1 | 1] = tag[o];
        kind[o << 1] = kind[o << 1 | 1] = 1;
        tag[o] = 0;
    }
}
inline void build(int o, int l, int r) {
    if (l == r) {
        rc[o] = lc[o] = b[l];
        kind[o] = 1;
        return;
    }
    int mid = (l + r) >> 1;
    build(o << 1, l, mid), build(o << 1 | 1, mid + 1, r);
    pushUp(o);
}
inline int query(int o, int l, int r, int L, int R) {
    if (l >= L && r <= R) {
        return kind[o];
    }
    pushDown(o);
    int mid = (l + r) >> 1, ans1 = 0, ans2 = 0;
    if (mid >= L) ans1 = query(o << 1, l, mid, L, R);
    if (mid < R) ans2 = query(o << 1 | 1, mid + 1, r, L, R);
    if (ans1 && ans2) ans1 -= (rc[o << 1] == lc[o << 1 | 1]);
    return ans1 + ans2;
}
inline void modify(int o, int l, int r, int L, int R, int C) {
    if (l >= L && r <= R) {
        lc[o] = rc[o] = tag[o] = C;
        kind[o] = 1;
        return;
    }
    pushDown(o);
    int mid = (l + r) >> 1;
    if (mid >= L) modify(o << 1, l, mid, L, R, C);
    if (mid < R) modify(o << 1 | 1, mid + 1, r, L, R, C);
    pushUp(o);
}
inline int getc(int o, int l, int r, int p) {
    if (l == r) return lc[o];
    pushDown(o);
    int mid = (l + r) >> 1;
    if (p <= mid) return getc(o << 1, l, mid, p);
    else return getc(o << 1 | 1, mid + 1, r, p);
}
inline int Query(int x, int y) {
    int bx, by, ret = 0;
    while (bel[x] != bel[y]) {
        bx = bel[x], by = bel[y];
        if (dep[bx] < dep[by]) {
            swap(bx, by); swap(x, y);
        }
        ret += query(1, 1, n, pos[bx], pos[x]);
        x = fa[bx];
        ret -= (getc(1, 1, n, pos[bx]) == getc(1, 1, n, pos[x]));
    }
    if (dep[x] > dep[y]) swap(x, y);
    ret += query(1, 1, n, pos[x], pos[y]);
    return ret;
}
inline void Modify(int x, int y, int c) {
    int bx, by;
    while (bel[x] != bel[y]) {
        bx = bel[x], by = bel[y];
        if (dep[bx] < dep[by]) {
            swap(bx, by), swap(x, y);
        }
        modify(1, 1, n, pos[bx], pos[x], c);
        x = fa[bx];
    }
    if (dep[x] > dep[y]) swap(x, y);
    modify(1, 1, n, pos[x], pos[y], c);
}
int main(void) {
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    read(n), read(m);
    for (int i = 1; i <= n; i++) read(a[i]);
    for (int i = 1, a, b; i < n; i++) {
        read(a), read(b);
        add(a, b); add(b, a);
    }
    dfs1(1, 0); dfs2(1, 1);

    build(1, 1, n); char op; int x, y, c;
    for (int i = 1; i <= m; i++) {
        read(op); read(x), read(y);
        if (op == 'Q') printf("%d\n", Query(x, y));
        else read(c), Modify(x, y, c);
    }
    return 0;
}

完。

By g1n0st