多源最短路 Johnson 算法模板

#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
#define INF 1e9
typedef pair<int, int> PII;
const int N = 3010;
const int M = 6010;

int h[N], e[M + N], ne[M + N], par[M + N], w[M + N];
int idx;
long long d[N][N];
int dis[N];
int st[N];
int tmp[N];
int n, m;

void add(int a, int b, int c)
{
    par[idx] = a;
    w[idx] = c;
    e[idx] = b;
    ne[idx] = h[a];
    h[a] = idx++;
}
void relax(int u, int v, int weight)
{
    if (dis[v] > dis[u] + weight)
        dis[v] = dis[u] + weight;
}
bool Bellman_Ford()
{
    memset(dis, 0x3f, sizeof(dis));
    dis[0] = 0;
    for (int i = 0; i < n; i++) // 增加下标为 0 的源节点
        for (int j = 0; j < m + n; j++) // 共有 m + n 条边
            relax(par[j], e[j], w[j]);
    for (int j = 0; j < m + n; j++)
        if (dis[e[j]] > dis[par[j]] + w[j])
            return false;
    return true;
}

void dijkstra(int u)
{
    memset(tmp, 0x3f, sizeof(tmp));
    memset(st, 0, sizeof(st));
    tmp[u] = 0;
    priority_queue<PII, vector<PII>, greater<PII> > heap;
    heap.push({ 0, u }); // dis[u] = 0 距离为第一关键字， 因为要根据距离进行排序

    while (heap.size())
    {
        PII k = heap.top();
        heap.pop();
        int ver = k.second, dist = k.first;
        if (st[ver]) continue;
        st[ver] = true;
        for (int i = h[ver]; i != -1; i = ne[i])
        {
            int j = e[i]; // 更新从这个点出发的所有边
            if (tmp[j] > w[i] + dist)
            {
                tmp[j] = w[i] + dist;
                heap.push({ tmp[j], j });
            }
        }
    }
}

int main()
{
    cin.tie(0);
    memset(h, -1, sizeof(h));
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        add(a, b, c);
    }
    for (int i = 1; i <= n; i++) add(0, i, 0); // 增加源节点 s 到其余所有顶点的边
    if (!Bellman_Ford()) cout << -1;
    else
    {
        for (int i = 0; i < m + n; i++)
            w[i] = w[i] + dis[par[i]] - dis[e[i]];
        for (int i = 1; i <= n; i++)
        {
            dijkstra(i);
            for (int j = 1; j <= n; j++)
                if (tmp[j] == 0x3f3f3f3f) d[i][j] = INF;
                else  d[i][j] = tmp[j] + dis[j] - dis[i];
        }
        for (int i = 1; i <= n; i++)
        {
            long long sum = 0;
            for (long long j = 1; j <= n; j++)
                sum += j * d[i][j];
            cout << sum << '\n';
        }
    }
}