树链剖分模板

点权模板：

1、M a b c将节点a到节点b路径上所有点都染成颜色c；
2、Q a b询问节点a到节点b路径上的颜色段数量（连续相同颜色被认为是同一段），如“112221”由3段组成：“11”、“222”和“1”。

const int N = 100100;
struct edge
{
    int to, next;
}g[N*2];
int cnt, head[N];
int dep[N], siz[N], son[N], fat[N], id[N], top[N];
int color[N], d[N][2], pos[N];
int n, m, num;
struct node
{
    int l, r, lc, rc, val, mark; /*lc, rc记录区间左端点和右端点颜色，*/
}tr[N*4];
void init()
{
    cnt = 0;
    memset(head, -1, sizeof head);
    num = 0;
}
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)
{ /*区间合并，判断左儿子的右端点和右儿子的左端点是否相同，更新父节点左右端点颜色*/
    tr[k].lc = tr[k<<1].lc, tr[k].rc = tr[k<<1|1].rc;
    if(tr[k<<1].rc == tr[k<<1|1].lc)
        tr[k].val = tr[k<<1].val + tr[k<<1|1].val - 1;
    else tr[k].val = tr[k<<1].val + tr[k<<1|1].val;
}
void push_down(int k)
{
    if(tr[k].mark)
    {
        tr[k<<1].mark = tr[k<<1|1].mark = tr[k].mark;
        tr[k<<1].lc = tr[k<<1].rc = tr[k<<1|1].lc = tr[k<<1|1].rc = tr[k].mark;
        tr[k<<1].val = tr[k<<1|1].val = 1;
        tr[k].mark = 0;
    }
}
void build(int l, int r, int k)
{
    tr[k].l = l, tr[k].r = r, tr[k].val = 1, tr[k].mark = 0;
    if(l == r)
    {
        tr[k].lc = tr[k].rc = pos[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, k << 1);
    build(mid + 1, r, k << 1|1);
    push_up