2019年ICPC南昌网络赛 J. Distance on the tree【树链剖分/DFS序+可持久化线段树】

传送门

题目描述：给你一个树，多次询问一条链上边权小于等于 k 边的数量。

解题思路：树链剖分+可持久化线段树：主要是两个模板的合并使用，主要细节即可（可持久化主席树查询时注意时间戳）。
DFS序+可持久化线段树：每个儿子的状态都是由父亲得到的，我们只需要用父亲的状态来更新儿子即可，最后求一个LCA，查询两个端点和LCA的状态改变量即可。

这道题也可以树链剖分+树状数组。。。我不会。。。

树链剖分+可持久化线段树代码：

///https://blog.csdn.net/mmk27_word/article/details/89421578

///#include<bits/stdc++.h>
///#include<unordered_map>
///#include<unordered_set>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<bitset>
#include<set>
#include<stack>
#include<map>
#include<list>
#include<new>
#include<vector>

#define MT(a, b) memset(a,b,sizeof(a));
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai = acos(-1.0);
const double E = 2.718281828459;
const int mod = 20071027;
const int INF = 0x3f3f3f3f;
const int maxn = 1e5 + 10;

struct node_e {
    int e, c, p;
} load[maxn * 2];
int head[maxn], sign;

void add_edge(int s, int e, int c) {
    load[++sign] = node_e{e, c, head[s]};
    head[s] = sign;
}

struct node {
    int ls, rs, cnt;
} p[maxn * 40];
int root[maxn], times;

void insert(int &now, int old, int l, int r, int x) {
    now = ++times;
    p[now] = p[old], p[now].cnt++;
    if (l == r) return;
    int mid = (l + r) >> 1;
    if (x <= mid) insert(p[now].ls, p[old].ls, l, mid, x);
    else insert(p[now].rs, p[old].rs, mid + 1, r, x);
}

int query(int sta, int end, int l, int r, int x) {
    if (r <= x) return p[end].cnt - p[sta].cnt;
    int mid = (l + r) >> 1;
    if (x <= mid) return query(p[sta].ls, p[end].ls, l, mid, x);
    else return p[p[end].ls].cnt - p[p[sta].ls].cnt + query(p[sta].rs, p[end].rs, mid + 1, r, x);
}

int father[maxn], sizes[maxn], h_son[maxn], depth[maxn], dis[maxn];
int top[maxn], id[maxn], ranks[maxn], t;

void dfs1(int s, int pre) {
    father[s] = pre, sizes[s] = 1, depth[s] = depth[pre] + 1;
    for (int i = head[s], e; ~i; i = load[i].p) {
        e = load[i].e;
        if (e ^ pre) {
            dfs1(e, s);
            sizes[s] += sizes[e], dis[e] = load[i].c;
            if (sizes[e] > sizes[h_son[s]]) h_son[s] = e;
        }
    }
}

void dfs2(int s, int r) {
    id[s] = ++t, ranks[t] = s, top[s] = r;
    insert(root[t], root[t - 1], 1, 1e9, dis[s]);
    if (h_son[s]) dfs2(h_son[s], r);
    for (int i = head[s], e; ~i; i = load[i].p) {
        e = load[i].e;
        if (e ^ father[s] && e ^ h_son[s]) dfs2(e, e);
    }
}

int query_line(int a, int b, int c) {
    int ans = 0;
    while (top[a] != top[b]) {
        if (depth[top[a]] > depth[top[b]]) swap(a, b);
        ans += query(root[id[top[b]] - 1], root[id[b]], 1, 1e9, c);
        b = father[top[b]];
    }
    if (depth[a] > depth[b]) swap(a, b);
    ans += query(root[id[a]], root[id[b]], 1, 1e9, c);
    return ans;
}

void init() {
    sign = t = times = 0;
    memset(p, 0, sizeof(p));
    for (int i = 0; i < maxn; i++) {
        head[i] = -1;
        root[i] = father[i] = sizes[i] = h_son[i] = depth[i] = dis[i] = 0;
    }
}

int main() {
    init();
    int n, op, s, e, c;
    scanf("%d %d", &n, &op);
    for (int i = 1; i < n; i++) {
        scanf("%d %d %d", &s, &e, &c);
        add_edge(s, e, c), add_edge(e, s, c);
    }
    dfs1(1, 0), dfs2(1, 1);
    while (op--) {
        scanf("%d %d %d", &s, &e, &c);
        printf("%d\n", c ? query_line(s, e, c) : 0);
    }
    return 0;
}

DFS序+可持久化线段树+LCA 代码：
 

///https://blog.csdn.net/mmk27_word/article/details/89421578

///#include<bits/stdc++.h>
///#include<unordered_map>
///#include<unordered_set>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<bitset>
#include<set>
#include<stack>
#include<map>
#include<list>
#include<new>
#include<vector>

#define MT(a, b) memset(a,b,sizeof(a));
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai = acos(-1.0);
const double E = 2.718281828459;
const int mod = 20071027;
const int INF = 0x3f3f3f3f;
const int maxn = 1e5 + 10;

struct node_e {
    int e, c, p;
} load[maxn * 2];
int head[maxn], sign;

void add_edge(int s, int e, int c) {
    load[++sign] = node_e{e, c, head[s]};
    head[s] = sign;
}

struct node {
    int ls, rs, cnt;
} p[maxn * 40];
int root[maxn], times;

void insert(int &now, int old, int l, int r, int x) {
    now = ++times;
    p[now] = p[old], p[now].cnt++;
    if (l == r)
        return;
    int mid = (l + r) >> 1;
    if (x <= mid) insert(p[now].ls, p[old].ls, l, mid, x);
    else insert(p[now].rs, p[old].rs, mid + 1, r, x);
}

int query(int sta, int end, int l, int r, int x) {
    if (r <= x) return p[end].cnt - p[sta].cnt;
    int mid = (l + r) >> 1;
    if (x <= mid) return query(p[sta].ls, p[end].ls, l, mid, x);
    else return p[p[end].ls].cnt - p[p[sta].ls].cnt + query(p[sta].rs, p[end].rs, mid + 1, r, x);
}

int grand[maxn][20], dis[maxn], depth[maxn], id[maxn], N, t;

void dfs(int s, int pre) {
    for (int i = 1; i <= N; i++)
        grand[s][i] = grand[grand[s][i - 1]][i - 1];
    depth[s] = depth[pre] + 1;
    id[s] = ++t;
    insert(root[id[s]], root[id[pre]], 1, 1e9, dis[s]);
    for (int i = head[s], e; ~i; i = load[i].p) {
        e = load[i].e;
        if (e ^ pre) {
            dis[e] = load[i].c;
            grand[e][0] = s;
            dfs(e, s);
        }
    }
}

int get_lca(int a, int b) {
    if (depth[a] > depth[b]) swap(a, b);
    for (int i = N; i >= 0; i--) if (depth[b] >= depth[a] && depth[grand[b][i]] >= depth[a]) b = grand[b][i];
    for (int i = N; i >= 0; i--) if (grand[b][i] != grand[a][i]) { a = grand[a][i], b = grand[b][i]; }
    return a == b ? a : grand[b][0];
}

int query_line(int a, int b, int c) {
    int x = get_lca(a, b);
    return query(root[id[x]], root[id[a]], 1, 1e9, c) + query(root[id[x]], root[id[b]], 1, 1e9, c);
}

void init(int n) {
    N = log2(n);
    sign = t = times = 0;
    memset(head, -1, sizeof(head));
    memset(p, 0, sizeof(p));
    memset(grand, 0, sizeof(grand));
    memset(id, 0, sizeof(id));
    depth[0] = -1;
}

int main() {
    int n, op, s, e, c;
    scanf("%d %d", &n, &op);
    init(n);
    for (int i = 1; i < n; i++) {
        scanf("%d %d %d", &s, &e, &c);
        add_edge(s, e, c), add_edge(e, s, c);
    }
    dfs(1, 0);
    while (op--) {
        scanf("%d %d %d", &s, &e, &c);
        printf("%d\n", c == 0 ? 0 : query_line(s, e, c));
    }
    return 0;
}