I - Imperial roads Gym - 101889I（LCA+最小生成树）

题意：
一个有权图，求每次必须选一个边的最小生成树值。

思路：
先跑出最小生成树，然后对于给出的x,y，在最小生成树上找到其路径，删掉一条最大边，再加上(x,y)这条边就是最小生成树的值了。

#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>

using namespace std;

typedef long long ll;
const int maxn = 2e5 + 7;

map<pair<int,int>,int>mp; //每个边的权值
map<pair<int,int>,int>vis; //MST是否选过这个边

struct Edge {
    int x,y,z;
}a[maxn];
int cmp(Edge a,Edge b) {
    return a.z < b.z;
}

int fa[maxn];
int findset(int x) {
    if(fa[x] == x) return fa[x];
    return fa[x] = findset(fa[x]);
}
void Union(int x,int y) {
    int rx = findset(x),ry = findset(y);
    if(rx != ry) {
        fa[rx] = ry;
    }
}

int f[maxn][22],d[maxn],mx[maxn][22];
vector<pair<int,int>>G[maxn];
void dfs(int x,int fa) {
    for(int i = 0;i < G[x].size();i++) {
        int v = G[x][i].first,w = G[x][i].second;
        if(v == fa) continue;
        d[v] = d[x] + 1;
        f[v][0] = x;
        mx[v][0] = w;
        dfs(v,x);
    }
}
int lca(int x,int y) {
    if(d[x] < d[y]) swap(x,y);
    int res = 0;
    for(int i = 20;i >= 0;i--) {
        if(d[f[x][i]] >= d[y]) {
            res = max(res,mx[x][i]);
            x = f[x][i];
        }
    }
    if(x == y) return res;
    for(int i = 20;i >= 0;i--) {
        if(f[x][i] != f[y][i]) {
            res = max(res,mx[x][i]);
            res = max(res,mx[y][i]);
            x = f[x][i];
            y = f[y][i];
        }
    }
    res = max(res,max(mx[x][0],mx[y][0]));
    return res;
}

int main() {
    int n,m;scanf("%d%d",&n,&m);
    for(int i = 1;i <= m;i++) {
        int x,y,z;scanf("%d%d%d",&x,&y,&z);
        a[i].x = x;a[i].y = y;a[i].z = z;
        mp[{a[i].x,a[i].y}] = mp[{a[i].y,a[i].x}] = a[i].z;
    }
    sort(a + 1,a + 1 + m,cmp);
    
    for(int i = 1;i <= n;i++) {
        fa[i] = i;
    }
    
    int cnt = 0;
    ll ans = 0;
    for(int i = 1;i <= m;i++) {
        int x = a[i].x,y = a[i].y,z = a[i].z;
        int rx = findset(x),ry = findset(y);
        if(rx != ry) {
            ans += z;
            Union(x,y);
            G[x].push_back({y,z});
            G[y].push_back({x,z});
            vis[{x,y}] = vis[{y,x}] = 1;
            cnt++;
        }
        if(cnt >= n - 1) break;
    }
    
    d[1] = 1;f[1][0] = 0;
    mx[1][0] = 0;
    dfs(1,-1);
    for(int i = 1;i <= 20;i++) {
        for(int j = 1;j <= n;j++) {
            f[j][i] = f[f[j][i - 1]][i - 1];
            mx[j][i] = max(mx[j][i - 1],mx[f[j][i - 1]][i - 1]);
        }
    }
    
    int q;scanf("%d",&q);
    for(int i = 1;i <= q;i++) {
        int x,y;scanf("%d%d",&x,&y);
        if(vis[{x,y}]) printf("%lld\n",ans);
        else {
            int num = lca(x,y);
            printf("%lld\n",ans - num + mp[{x,y}]);
        }
    }
    return 0;
}