POJ ~ 1511 ~ Invitation Cards （逆向建边 + (SPFA或(优先队列优化的Dijkstra))）

题意：N（1e6）个点，M条单向边（边权1e9），求1~所有点的最短路径之和，再加上所有点~1点的最短路径之和。

思路：正向建边求一次1到所有点的最短距离，在反向建边求一次。加和就是答案。但是数据范围很大1e6，所以要用SPFA或优先队列优化的Dijkstra。还有就是路径之和会超int要开long long。

优先队列优化Dijkstra：

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<queue>
using namespace std;
const int MAXN = 1e6 + 5;
const int INF = 1e9 + 5;
struct Edge
{
    int from, to, dist;       //起点,终点,距离
    Edge(int u, int v, int w):from(u), to(v), dist(w) {}
};

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];            //标记数组
    long long d[MAXN];              //s到各个点的最短路
    int pre[MAXN];            //上一条弧

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

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

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

    void dijkstra(int s)
    {
        priority_queue<HeapNode> Q;
        for (int i = 0; i <= n; i++) d[i] = INF;
        d[s] = 0;
        memset(vis, 0, sizeof(vis));
        Q.push(HeapNode(s, 0));
        while (!Q.empty())
        {
            HeapNode x = Q.top(); Q.pop();
            int u = x.u;
            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];
                    Q.push(HeapNode(e.to, d[e.to]));
                }
            }
        }
    }
};
Dijkstra solve;
struct In
{
    int u, v, w;
}in[MAXN];
int n, m;
int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d%d", &n, &m);
        for (int i = 0; i < m; i++) scanf("%d%d%d", &in[i].u, &in[i].v, &in[i].w);

        long long ans = 0;

        solve.init(n);
        for (int i = 0; i < m; i++) { solve.add_edge(in[i].u, in[i].v, in[i].w); }
        solve.dijkstra(1);
        for (int i = 1; i <= n; i++) ans += solve.d[i];

        solve.init(n);
        for (int i = 0; i < m; i++) solve.add_edge(in[i].v, in[i].u, in[i].w);
        solve.dijkstra(1);
        for (int i = 1; i <= n; i++) ans += solve.d[i];

        printf("%lld\n", ans);
    }
    return 0;
}
/*
2
2 2
1 2 13
2 1 33
4 6
1 2 10
2 1 60
1 3 20
3 4 10
2 4 5
4 1 50
*/

SPFA：

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
const int MAXN = 1e6 + 5;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int from, to, dist;       //起点,终点,距离
    Edge(int u, int v, int w):from(u), to(v), dist(w) {}
};
struct BellmanFord
{
    int n, m;                      //结点数,边数(包括反向弧)
    vector<Edge> edges;            //边表。edges[e]和edges[e^1]互为反向弧
    vector<int> G[MAXN];           //邻接表，G[i][j]表示结点i的第j条边在edges数组中的序号
    bool vis[MAXN];                //是否在队列中
    long long d[MAXN];                   //Bellman-Ford
    int p[MAXN];                   //上一条弧
    int cnt[MAXN];                 //进队次数

    void init(int n)
    {
        this->n = n;
        edges.clear();
        for (int i = 0; i <= n; i++) G[i].clear();
    }
    void add_edge(int from, int to, int dist)
    {
        edges.push_back(Edge(from, to, dist));
        m = edges.size();
        G[from].push_back(m - 1);
    }

    bool bellman_ford(int s)
    {
        for (int i = 0; i <= n; i++) d[i] = INF;
        memset(vis, 0, sizeof(vis));
        memset(cnt, 0, sizeof(cnt));
        d[s] = 0; vis[s] = true;

        queue<int> Q;
        Q.push(s);
        while (!Q.empty())
        {
            int u = Q.front(); Q.pop();
            vis[u] = false;
            for (int i = 0; i < G[u].size(); i++)
            {
                Edge& e = edges[G[u][i]];
                if (d[u] < INF && d[e.to] > d[u] + e.dist)
                {
                    d[e.to] = d[u] + e.dist;
                    p[e.to] = G[u][i];
                    if (!vis[e.to])
                    {
                        Q.push(e.to); vis[e.to] = true;
                        if (++cnt[e.to] > n) return false;//有负环
                    }
                }
            }
        }
        return true;//没有负环
    }
};
BellmanFord solve;
struct In
{
    int u, v, w;
}in[MAXN];
int n, m;
int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d%d", &n, &m);
        for (int i = 0; i < m; i++) scanf("%d%d%d", &in[i].u, &in[i].v, &in[i].w);

        long long ans = 0;

        solve.init(n);
        for (int i = 0; i < m; i++) { solve.add_edge(in[i].u, in[i].v, in[i].w); }
        solve.bellman_ford(1);
        for (int i = 1; i <= n; i++) ans += solve.d[i];

        solve.init(n);
        for (int i = 0; i < m; i++) solve.add_edge(in[i].v, in[i].u, in[i].w);
        solve.bellman_ford(1);
        for (int i = 1; i <= n; i++) ans += solve.d[i];

        printf("%lld\n", ans);
    }
    return 0;
}
/*
2
2 2
1 2 13
2 1 33
4 6
1 2 10
2 1 60
1 3 20
3 4 10
2 4 5
4 1 50
*/