List wants to travel

题解：树链剖分+区间合并。链剖注意一下因为是边权不是点权，所以我是忽略根节点，从第二的节点开始给dfs序，把对应节点的边权当作点权，之后的change和query都要注意一下。然后线段树记录三个值，l , r , val ， 分别代表区间的左右值以及区间中一共有多少个不同的块，然后合并就比较显然了。注意的是当作区间查询的时候要注意以下细节。我是定义从s到t的路径，所以对于从s路径往上走的区间，我要合并的是 find().inver()，因为自上而下的dfs序是递增的，而s往上走是从大到小的，所以区间的ｌｒ值要交换一下。还有区间合并的先后顺序也要注意一下。

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <string>
using namespace std;

const int maxn = 100000;

struct State {
    int l, r, val;
    State() {
        l = 0; r = 0; val = 0;
    }
    bool operator==(const State &other) {
        if (l == other.l && r == other.r && val == other.val) return true;
        return false;
    }
    State inver() {
        swap(l, r);
        return *this;
    }
}tree[maxn*10];
vector<int> tar[maxn], cost[maxn];
int son[maxn], dep[maxn], siz[maxn], top[maxn], id[maxn], fa[maxn], c_tree[maxn*10], edge[maxn];
int n, m, x, y, z, num;
int t1, t2, ot1, ot2, s, t;
State s1, s2, ans;
string str_s;


State combine(State x, State y) {   //区间合并
    if (x.val == 0) return y;
    if (y.val == 0) return x;
    State temp;
    temp.l = x.l;
    temp.r = y.r;
    temp.val = x.val+y.val;
    if (x.r == y.l) temp.val--;
    return temp;
}

void insert(int x, int l, int r, int t, int v) {
    if (l == r) {
        tree[x].l = v;
        tree[x].r = v;
        tree[x].val = 1;
        return;
    }
    int mid = (l+r)/2;
    if (t <= mid) insert(x*2, l, mid, t, v);
    else insert(x*2+1, mid+1, r, t, v);
    tree[x] = combine(tree[x*2], tree[x*2+1]);
}

void pushdown(int x, int l, int r) {
    if (c_tree[x] != 0 && l != r) {
        tree[x*2].val = 1; tree[x*2].l = c_tree[x]; tree[x*2].r = c_tree[x];
        tree[x*2+1].val = 1; tree[x*2+1].l = c_tree[x]; tree[x*2+1].r = c_tree[x];
        c_tree[x*2] = c_tree[x]; c_tree[x*2+1] = c_tree[x]; c_tree[x] = 0;
    }
}

void change(int x, int l, int r, int ll, int rr, int v) {
    if (l == ll && r == rr) {
        c_tree[x] = v;
        tree[x].l = v; tree[x].r = v; tree[x].val = 1;
        return;
    }
    pushdown(x, l, r);
    int mid = (l+r)/2;
    if (rr <= mid) change(x*2, l, mid, ll, rr, v);
    else if (ll >= mid+1) change(x*2+1, mid+1, r, ll, rr, v);
    else {
        change(x*2, l, mid, ll, mid, v);
        change(x*2+1, mid+1, r, mid+1, rr, v);
    }
    tree[x] = combine(tree[x*2], tree[x*2+1]);
}

State find(int x, int l, int r, int ll, int rr) {
    if (l == ll && r == rr) {
        return tree[x];
    }
    pushdown(x, l, r);
    int mid = (l+r)/2;
    if (rr <= mid) return find(x*2, l, mid, ll, rr);
    else if (ll >= mid+1) return find (x*2+1, mid+1, r, ll, rr);
    else {
        State temp1 = find(x*2, l, mid, ll, mid);
        State temp2 = find(x*2+1, mid+1, r, mid+1, rr);
        return combine(temp1, temp2);
    }
}

void dfs1(int u, int fa_, int d) {  //确定重链以及edge[] 
    dep[u] = d;
    siz[u] = 1;
    son[u] = 0;
    fa[u] = fa_;
    int _size = tar[u].size();
    for (int i = 0; i < _size; i++) {
        int k = tar[u][i];
        if (k == fa[u]) continue;
        edge[k] = cost[u][i];
        dfs1(k, u, d+1);
        siz[u] += siz[k];
        if (siz[son[u]] < siz[k]) son[u] = k;
    }
}

void dfs2(int u, int tp) {  //确定dfs序并且建立线段树
    top[u] = tp;
    id[u] = num++;
    if (id[u] != 0) insert(1, 1, n, id[u], edge[u]);
    if (son[u]) dfs2(son[u], tp);
    int _size = tar[u].size();
    for (int i = 0; i < _size; i++) {
        int k = tar[u][i];
        if (k == fa[u] || k == son[u]) continue;
        dfs2(k, k);
    }
}

int query(int s, int t) {//查询节点s到节点t的不同块的数目
    t1 = s; t2 = t;
    ot1 = s; ot2 = t;
    s1.l = s1.r = s1.val = 0;
    s2.l = s2.r = s2.val = 0;
    while (1) {
        if (t1 == t2) {
            if (ot1 != s) {
                swap(t1, t2);
                swap(s1, s2);
                swap(ot1, ot2);
            }
            ans = combine(s1, s2);
            return ans.val;
        }
        if (dep[top[t1]] > dep[top[t2]] || (dep[top[t1]] == dep[top[t2]] && dep[t1] > dep[t2])) {
            swap(t1, t2);
            swap(s1, s2);
            swap(ot1, ot2);
        }
        if (top[t1] == top[t2]) {
            if (ot2 == s) s2 = combine(s2, find(1, 1, n, id[son[t1]], id[t2]).inver());
            else s2 = combine(find(1, 1, n, id[son[t1]], id[t2]), s2);
            t2 = t1;
        } else if (top[t2] == t2) {
            if (ot2 == s) s2 = combine(s2, find(1, 1, n, id[t2], id[t2]).inver());
            else s2 = combine(find(1, 1, n, id[t2], id[t2]), s2);
            t2 = fa[t2];
        } else {
            if (ot2 == s) s2 = combine(s2, find(1, 1, n, id[son[top[t2]]], id[t2]).inver());
            else s2 = combine(find(1, 1, n, id[son[top[t2]]], id[t2]), s2);
            t2 = top[t2];
        }
    }
}

int _change(int s, int t, int v) {//修改节点s到节点t的路径的权值
    t1 = s; t2 = t;
    while (1) {
        if (t1 == t2) break;
        if (dep[top[t1]] > dep[top[t2]] || (dep[top[t1]] == dep[top[t2]] && dep[t1] > dep[t2])) {
            swap(t1, t2);
        }
        if (top[t1] == top[t2]) {
            change(1, 1, n, id[son[t1]], id[t2], v);
            t2 = t1;
        } else if (top[t2] == t2) {
            change(1, 1, n, id[t2], id[t2], v);
            t2 = fa[t2];
        } else {
            change(1, 1, n, id[son[top[t2]]], id[t2], v);
            t2 = top[t2];
        }
    }
}

void init() {
    num = 0;
    for (int i = 1; i <= n; i++) {  //链表
        tar[i].clear();
        cost[i].clear();
    }
    memset(edge, 0, sizeof(edge));  //节点往上的边权
    memset(son, 0, sizeof(son));    //对应节点重链的儿子
    memset(dep, 0, sizeof(dep));    //对应节点的深度
    memset(siz, 0, sizeof(siz));    //对应节点往下的最大深度
    memset(top, 0, sizeof(top));    //对应节点走重链往上的最高节点
    memset(id , 0, sizeof(id ));    //对应节点的dfs序
    memset(fa , 0, sizeof(fa ));    //对应节点的父亲
}

int main() {
    freopen("a.in","r",stdin);

    while (scanf("%d %d", &n, &m) != EOF) {
        init();
        for (int i = 1; i <= n-1; i++) {
            scanf("%d %d %d", &x, &y, &z);
            tar[x].push_back(y);
            tar[y].push_back(x);
            cost[x].push_back(z);
            cost[y].push_back(z);
        }
        dfs1(1, 0, 1);
        dfs2(1, 1);
        while (m--) {
            cin >> str_s;
            if (str_s == "Query") {
                scanf("%d %d", &x, &y);
                printf("%d\n", query(x, y));
            } else {
                scanf("%d %d %d", &x, &y, &z);
                _change(x, y, z);
            }
        }
    }
}