【2022年11月19日提高A组】最短路问题 V3【最短路】【LCA】

思路：

因为m-n<=20，所以直接先随便跑一颗树，然后不是树边的拿出端点，跑它们的最短路。
然后求答案直接lca

$code$

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#define ll long long

using namespace std;

const ll MAXN = 2e5 + 10;

ll n, m, k, q[100], tot, cnt, head[MAXN];
ll dep[MAXN], f[MAXN][21], d[MAXN];
ll dis[50][MAXN];
bool v[MAXN];
struct node {
	ll next, to, w;
}b[MAXN * 2];

void add(ll x, ll y, ll w) {
	b[++ tot] = (node) { head[x], y, w };
	head[x] = tot;
}

void dfs(ll x, ll fa) {
	dep[x] = dep[fa] + 1;
	f[x][0] = fa;
	for(ll i = 1; i <= 20; i ++)
		f[x][i] = f[f[x][i - 1]][i - 1];
	for(ll i = head[x]; i; i = b[i].next) {
		ll y = b[i].to;
		if(y == fa) continue;
		if(dep[y] != 0) {
			q[++ cnt] = x, q[++ cnt] = y;
			continue;
		}
		d[y] = d[x] + b[i].w;
		dfs(y, x);
	}
}

void dij(ll s) {
	priority_queue<pair<ll, ll> > g;
	memset(v, 0, sizeof(v));
	memset(dis[s], 0x7f, sizeof(dis[s]));
	dis[s][q[s]] = 0;
	g.push(make_pair(0, q[s]));
	while(!g.empty()) {
		ll x = g.top().second;
		g.pop();
		if(v[x]) continue;
		v[x] = 1;
		for(ll i = head[x]; i; i = b[i].next) {
			ll y = b[i].to;
			if(dis[s][y] > dis[s][x] + b[i].w) {
				dis[s][y] = dis[s][x] + b[i].w;
				g.push(make_pair(-dis[s][y], y));
			}
		}
	}
}

ll lca(ll x, ll y) {
	if(dep[x] > dep[y]) swap(x, y);
	ll k = dep[y] - dep[x], t = 1 << 20, j = 20;
	while(k) {
		if(k >= t) k -= t, y = f[y][j];
		j --, t = 1 << j;
	}
	if(x == y) return x;
	for(ll i = 20; i >= 0; i --)
		if(f[x][i] != f[y][i]) x = f[x][i], y = f[y][i];
	return f[x][0];
}

int main() {
	scanf("%lld%lld", &n, &m);
	for(ll i = 1; i <= m; i ++) {
		ll x, y, w;
		scanf("%lld%lld%lld", &x, &y, &w);
		add(x, y, w), add(y, x, w);
	}
	dfs(1, 0);
	sort(q + 1, q + 1 + cnt);
	cnt = unique(q + 1, q + 1 + cnt) - q - 1;
	for(ll i = 1; i <= cnt; i ++)
		dij(i);
	scanf("%lld", &k);
	while(k --) {
		ll x, y;
		scanf("%lld%lld", &x, &y);
		ll l = lca(x, y);
		ll ans = d[x] + d[y] - 2 * d[l];
		for(ll i = 1; i <= cnt; i ++) {
			l = lca(x, q[i]);
			ans = min(ans, d[x] + d[q[i]] - 2 * d[l] + dis[i][y]);
		}
		printf("%lld\n", ans);
	}
	return 0;
}