cf1051F. The Shortest Statement(最短路)

题意

题目链接

题意：给出一张无向图，每次询问两点之间的最短路，满足$m - n <= 20$

$n, m, q \leqslant 10^5$

Sol

非常好的一道题。

首先建出一个dfs树。

因为边数-点数非常少，所以我们可以对于某些非树边特殊考虑。

具体做法是：对于非树边连接的两个点，暴力求出它们到所有点的最短路

对于询问的$(x, y)$

用树上的边，以及非树边连接的点到他们的最短路之和更新答案

由于边数的限制，非树边连接的点不会超过$2*(m - (n - 1)) = 42$个

#include<bits/stdc++.h>
#define Pair pair<int, int>
#define MP(x, y) make_pair(x, y)
#define fi first
#define se second
#define LL long long
using namespace std;
const int MAXN =  * 1e5 + ;
inline int read() {
    char c = getchar(); int x = , f = ;
    while(c < '' || c > '') {if(c == '-') f = -; c = getchar();}
    while(c >= '' && c <= '') x = x *  + c - '', c = getchar();
    return x * f;
}
int N, M, Q, head[MAXN], num = , vis[MAXN], fa[MAXN][], dep[MAXN], happen[MAXN];
LL dis[][MAXN], Tdis[MAXN];
vector<int> p;
struct Edge {
    LL u, v, w, f, nxt;
}E[MAXN];
inline void AddEdge(int x, int y, int z) {
    E[num] = (Edge) {x, y, z, , head[x]};
    head[x] = num++;
}
void dfs(int x, int _fa) {
    vis[x] = ; dep[x] = dep[_fa] + ;
    for(int i = head[x]; ~i; i = E[i].nxt) {
        int to = E[i].v;
        if(vis[to]) continue;
        E[i].f = E[i ^ ].f = ;
        Tdis[to] = Tdis[x] + (LL)E[i].w;
        fa[to][] = x;
        dfs(to, x);
    }
}
void Dij(int x, int id) {
    memset(dis[id], 0x7f, sizeof(dis[id])); dis[id][x] = ;
    memset(vis, , sizeof(vis));
    priority_queue<Pair> q; q.push(MP(, x));
    while(!q.empty()) {
        int p = q.top().se; q.pop();
        if(vis[p]) continue;
        for(int i = head[p]; ~i; i = E[i].nxt) {
            int to = E[i].v;
            if(dis[id][to] > dis[id][p] + E[i].w && (!vis[to]))
                dis[id][to] = dis[id][p] + E[i].w, q.push(MP(-dis[id][to], to));
        }
    }
}
void Pre() {
    for(int j = ; j <= ; j++)
        for(int i = ; i <= N; i++)
            fa[i][j] = fa[fa[i][j - ]][j - ];
}
int lca(int x, int y) {
    if(dep[x] < dep[y]) swap(x, y);
    for(int i = ; i >= ; i--)
        if(dep[fa[x][i]] >= dep[y]) x = fa[x][i];
    if(x == y) return x;
    for(int i = ; i >= ; i--)
        if(fa[x][i] != fa[y][i])
            x = fa[x][i], y = fa[y][i];
    return fa[x][];
}
main() {
//    freopen("a.in", "r", stdin);
    memset(head, -, sizeof(head));
    N = read(); M = read();
    for(int i = ; i <= M; i++) {
        int x = read(), y = read(), z = read();
        AddEdge(x, y, z);
        AddEdge(y, x, z);
    }
    dfs(, );
    for(int i = ; i < num; i++)
        if(!E[i].f) {
            if(!happen[E[i].u]) p.push_back(E[i].u), happen[E[i].u] = ;
            if(!happen[E[i].v]) p.push_back(E[i].v), happen[E[i].v] = ;
        }

    for(int i = ; i < p.size(); i++)
        Dij(p[i], i);
    Pre();
    int Q = read();
    while(Q--) {
        int x = read(), y = read();
        LL ans = Tdis[x] + Tdis[y] -  * Tdis[lca(x, y)];
        for(int i = ; i < p.size(); i++)
            ans = min(ans, dis[i][x] + dis[i][y]);
        cout << ans << endl;
    }
    return ;
}