牛客国庆集训派对Day3 ~ I ~ Metropolis（多源最短路，好题）

思路

本题是要求多点到多点的最短路，容易想到floyd但是时间明显爆炸。
我们另辟蹊径，我们把所有源点入队，跑dijkstra，如果某一条边(u,v,w)同时被两个点扩展到了的话，那么这两个点之间最短路就是dis[u]+dis[v]+w。
我们用from[i]表示第 i 个点是被第几个源点扩展到的，如果某条边的from[u] != from[v]，那么这条边有就是由两个不同的点扩展到的。
注意开long long即可。

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 3e5+5;
typedef long long LL;
const LL INF = 0x3f3f3f3f3f3f3f3f;

struct Edge
{
    int from, to; LL dist;       //起点,终点,距离
    Edge(int from, int to, LL dist):from(from), to(to), dist(dist) {}
};

struct Dijkstra
{
    int n, m;                 //结点数,边数(包括反向弧)
    vector<Edge> edges;       //边表。edges[e]和edges[e^1]互为反向弧
    vector<int> G[MAXN];      //邻接表，G[i][j]表示结点i的第j条边在edges数组中的序号
    int vis[MAXN];            //标记数组
    LL d[MAXN];              //s到各个点的最短路
    int pre[MAXN];              //上一条弧
    int from[MAXN];//被哪个源点扩展到的

    void init(int n)
    {
        this->n = n;
        edges.clear();
        for (int i = 0; i <= n; i++) G[i].clear();
    }

    void AddEdge(int from, int to, int dist)
    {
        edges.emplace_back(from, to, dist);
        m = edges.size();
        G[from].push_back(m - 1);
    }

    struct HeapNode
    {
        int from; LL dist;
        bool operator < (const HeapNode& rhs) const
        {
            return rhs.dist < dist;
        }
        HeapNode(int u, LL w): from(u), dist(w) {}
    };

    void dijkstra(int *s, int cnt, LL *ans)
    {
        priority_queue<HeapNode> Q;
        for (int i = 0; i <= n; i++) d[i] = INF;
        memset(vis, 0, sizeof(vis));
        for (int i = 0; i < cnt; i++)
        {
            d[s[i]] = 0; from[s[i]] = s[i];
            Q.push(HeapNode(s[i], 0));
        }
        while (!Q.empty())
        {
            HeapNode x = Q.top(); Q.pop();
            int u = x.from;
            if (vis[u]) continue;
            vis[u] = true;
            for (int i = 0; i < G[u].size(); i++)
            {
                Edge& e = edges[G[u][i]];
                if (d[e.to] > d[u] + e.dist)
                {
                    d[e.to] = d[u] + e.dist;
                    pre[e.to] = G[u][i];
                    from[e.to] = from[u];//被同一个源点扩展到的
                    Q.push(HeapNode(e.to, d[e.to]));
                }
                if (from[u] != from[e.to])//这条边的两个点不是由同一个源点扩展到的
                {
                    LL t = d[u]+d[e.to]+e.dist;
                    ans[from[u]] = min(ans[from[u]], t);
                    ans[from[e.to]] = min(ans[from[e.to]], t);
                }
            }
        }
    }
}gao;

int n, m, p, s[MAXN];
LL ans[MAXN];
int main()
{
    memset(ans, INF, sizeof(ans));
    scanf("%d%d%d", &n, &m, &p);
    gao.init(n);
    for (int i = 0; i < p; i++) scanf("%d", &s[i]);
    while (m--)
    {
        int u, v, w; scanf("%d%d%d", &u, &v, &w);
        gao.AddEdge(u, v, w);
        gao.AddEdge(v, u, w);
    }
    gao.dijkstra(s, p, ans);
    for (int i = 0; i < p; i++)
        printf("%lld%c", ans[s[i]], i == p - 1 ? '\n' : ' ');
    return 0;
}
/*
5 6 3
2 4 5
1 2 4
1 3 1
1 4 1
1 5 4
2 3 1
3 4 3
*/