HDU 5893 List wants to travel 树链剖分

题目：

http://acm.hdu.edu.cn/showproblem.php?pid=5893

题意：

给定一棵树，树有边权，有两种操作：

1. 改变两点之间路径上的边权为某个值
2. 查询两点之间路径上的边权序列有多少个连续区间

思路：

把边权映射到其邻接的两点中深度较大的点上去，树链剖分，线段上维护，线段树维护区间左端点和右端点颜色，合并时较麻烦。此题真正的难点在查询时，合并两个区间要判断端点颜色是否相同

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 100100;
struct edge
{
    int to, next;
}g[N*2];
int dep[N], siz[N], son[N], fat[N], id[N], top[N], head[N];
int tmp[N], d[N][3], val[N];
int n, m, num, cnt;
struct node
{
    int l, r, lc, rc, sum, mark;
}s[N*4];
void add_edge(int v, int u)
{
    g[cnt].to = u, g[cnt].next = head[v], head[v] = cnt++;
}
void dfs1(int v, int fa, int d)
{
    dep[v] = d, son[v] = 0, siz[v] = 1, fat[v] = fa;
    for(int i = head[v]; i != -1; i = g[i].next)
    {
        int u = g[i].to;
        if(u != fa)
        {
            dfs1(u, v, d + 1);
            siz[v] += siz[u];
            if(siz[son[v]] < siz[u]) son[v] = u;
        }
    }
}
void dfs2(int v, int tp)
{
    top[v] = tp, id[v] = ++num;
    if(son[v]) dfs2(son[v], top[v]);
    for(int i = head[v]; i != -1; i = g[i].next)
    {
        int u = g[i].to;
        if(u != fat[v] && u != son[v]) dfs2(u, u);
    }
}
void push_up(int k)
{
    s[k].lc = s[k<<1].lc, s[k].rc = s[k<<1|1].rc;
    if(s[k<<1].rc == s[k<<1|1].lc)
        s[k].sum = s[k<<1].sum + s[k<<1|1].sum - 1;
    else
        s[k].sum = s[k<<1].sum + s[k<<1|1].sum;
}
void push_down(int k)
{
    if(s[k].mark)
    {
        s[k<<1].mark = s[k<<1|1].mark = s[k].mark;
        s[k<<1].lc = s[k<<1].rc = s[k<<1|1].lc = s[k<<1|1].rc = s[k].mark;
        s[k<<1].sum = s[k<<1|1].sum = 1;
        s[k].mark = 0;
    }
}
void build(int l, int r, int k)
{
    s[k].l = l, s[k].r = r, s[k].sum = 1, s[k].mark = 0;
    if(l == r)
    {
        s[k].lc = s[k].rc = val[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, k << 1);
    build(mid + 1, r, k << 1|1);
    push_up(k);
}
void update(int l, int r, int c, int k)
{
    if(l <= s[k].l && s[k].r <= r)
    {
        s[k].sum = 1;
        s[k].lc = s[k].rc = c;
        s[k].mark = c;
        return;
    }
    push_down(k);
    int mid = (s[k].l + s[k].r) >> 1;
    if(l <= mid) update(l, r, c, k << 1);
    if(r > mid) update(l, r, c, k << 1|1);
    push_up(k);
}
void renew(int v, int u, int c)
{
    int t1 = top[v], t2 = top[u];
    while(t1 != t2)
    {
        if(dep[t1] < dep[t2])
            swap(t1, t2), swap(v, u);
        update(id[t1], id[v], c, 1);
        v = fat[t1], t1 = top[v];
    }
    if(v == u) return;
    if(dep[v] > dep[u]) swap(v, u);
    update(id[son[v]], id[u], c, 1);
}
int query(int l, int r, int k)
{
    if(l <= s[k].l && s[k].r <= r)
        return s[k].sum;
    push_down(k);
    int mid = (s[k].l + s[k].r) >> 1;
    int ans = 0, f1 = 0, f2 = 0;
    if(l <= mid)
        ans += query(l, r, k << 1), f1 = 1;
    if(r > mid)
        ans += query(l, r, k << 1|1), f2 = 1;
    if(f1 && f2)
        if(s[k<<1].rc == s[k<<1|1].lc) ans -= 1;
    return ans;
}
int query_node(int x, int k)
{
    if(s[k].l == s[k].r)
        return s[k].rc;
    push_down(k);
    int mid = (s[k].l + s[k].r) >> 1;
    int ans = 0;
    if(x <= mid) ans = query_node(x, k << 1);
    else ans = query_node(x, k << 1|1);
    push_up(k);
    return ans;
}
int seek(int v, int u)
{
    int t1 = top[v], t2 = top[u];
    int ans = 0;
    int cv = 0, cu = 0, x;
    while(t1 != t2)
    {
        if(dep[t1] < dep[t2])
            swap(t1, t2), swap(v, u), swap(cu, cv);
        ans += query(id[t1], id[v], 1);
        x = query_node(id[v], 1);//查询当前链的尾端颜色
        if(x == cv) ans--; //如果和当前链的前一段链的首端颜色一样，则-1
        cv = query_node(id[t1], 1);//查询并记录当前链的首端颜色
        v = fat[t1], t1 = top[v];
    }
    if(v == u)
    {
        if(cv == cu) ans--;
        return ans;
    }
    if(dep[v] > dep[u]) swap(v, u), swap(cv, cu);
    ans += query(id[son[v]], id[u], 1);
    //最后查询的这条链和两条链相接，所有都要判断相接处颜色是否相同
    x = query_node(id[u], 1);
    if(x == cu) ans--;
    x = query_node(id[son[v]], 1);
    if(x == cv) ans--;
    return ans;
}
int main()
{
    char str[100];
    int a, b, c;
    while(~ scanf("%d%d", &n, &m))
    {
        cnt = num = 0;
        memset(head, -1, sizeof head);
        for(int i = 1; i <= n - 1; i++)
        {
            scanf("%d%d%d", &d[i][0], &d[i][1], &d[i][2]);
            add_edge(d[i][0], d[i][1]), add_edge(d[i][1], d[i][0]);
        }
        dfs1(1, 0, 1);
        dfs2(1, 1);
        for(int i = 1; i <= n - 1; i++)
        {
            if(dep[d[i][0]] > dep[d[i][1]]) swap(d[i][0], d[i][1]);
            val[id[d[i][1]]] = d[i][2];
        }
        build(1, num, 1);
        for(int i = 1; i <= m; i++)
        {
            scanf(" %s", str);
            if(str[0] == 'Q')
            {
                scanf("%d%d", &a, &b);
                printf("%d\n", seek(a, b));
            }
            else
            {
                scanf("%d%d%d", &a, &b, &c);
                renew(a, b, c);
            }
        }
    }
    return 0;
}