[Luogu] 货车运输

https://www.luogu.org/problemnew/show/1967

kruskal + Lca

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>

using namespace std;
const int N = 1e5 + ;

#define oo 99999999

struct Node {
    int u, v, w;
} S[N * ];
struct Edge {
    int u, v, w, nxt;
} E[N << ];

int now = , n, m, js;
int head[N], p[N], f[N][], g[N][], deep[N];

inline int read() {
    int x = ;
    char c = getchar();
    while(c < '' || c > '') c = getchar();
    while(c >= '' && c <= '') x = x *  + c - '', c = getchar();
    return x;
}

inline bool cmp(Node a, Node b) {
    return a.w > b.w;
}

int getf(int x) {
    return p[x] == x ? x : p[x] = getf(p[x]);
}

void add(int u, int v, int w) {
    E[now].v = v;
    E[now].w = w;
    E[now].nxt = head[u];
    head[u] = now ++;
}

inline void Kruskal() {
    for(int i = , doen = ; i <= (m << ) && doen < n; i ++) {
        int u = S[i].u, v = S[i].v;
        int pu = getf(u), pv = getf(v);
        if(pu != pv) {
            p[pu] = pv;
            add(u, v, S[i].w);
            add(v, u, S[i].w);
            doen ++;
        }
    }
}

void make_deep(int u, int depth) {
    deep[u] = depth;
    for(int i = head[u]; ~ i; i = E[i].nxt) {
        int v = E[i].v;
        if(!deep[v]) {
            f[v][] = u;
            g[v][] = E[i].w;
            make_deep(v, depth + );
        }
    }
}

inline void make_jump() {
    for(int j = ; ( << j) <= n; j ++)
        for(int i = ; i <= n; i ++)
            if(f[i][j - ]) f[i][j] = f[f[i][j - ]][j - ], g[i][j] = min(g[i][j - ], g[f[i][j - ]][j - ]);
}

inline int lca(int x, int y) {
    int ret = oo;
    if(x == y) return ;
    if(deep[x] < deep[y]) swap(x, y);
    int k = log2(deep[x]);
    for(int i = k; i >= ; i --) {
        if(deep[f[x][i]] >= deep[y]) {
            ret = min(ret, g[x][i]);
            x = f[x][i];
        }
    }
    if(x == y) return ret;
    for(int i = k; i >= ; i --) {
        if(f[x][i] != f[y][i]) {
            ret = min(ret, min(g[x][i], g[y][i]));
            x = f[x][i];
            y = f[y][i];
        }
    }
    ret = min(ret, min(g[x][], g[y][]));
    return ret;
}

int main() {
    n = read();
    m = read();
    for(int i = ; i <= n; i ++) head[i] = -, p[i] = i;
    for(int i = ; i <= m; i ++) S[i].u = read(), S[i].v = read(), S[i].w = read();
    sort(S + , S + m + , cmp);
    Kruskal();
    for(int i = ; i <= n; i ++)
        if(!deep[i])
            make_deep(i, );//可能会有多块
    make_jump();
    int T = read();
    while(T --) {
        int x = read(), y = read();
        if(getf(x) != getf(y)) {
            printf("-1\n");
            continue ;
        }
        int answer = lca(x, y);
        printf("%d\n", answer);
    }
    return ;
}