HDU ~ 2680 ~ Choose the best route （反向建边 or 超级源点 + 最短路）

题意：第一行先输入n，m，s表示有n个点，m条边，s表示终点。然后下面m行，每行有三个数字p，q，t表示有一条p到q的单向边，边权为t。然后一行输入起点个数w。下面一行有w个数字，分别表示w个起点。问从起点（任意一个）到终点的最短路为多少？

思路1：加超级源点，  然后从超级源点连一条到所有起点的边，边权为0，然后求超级源点到s的最短路就可以了，本题中可以将超级源点设置为0。

超级源点：

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 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 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];            //标记数组
    int 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 from; int dist;
        bool operator < (const HeapNode& rhs) const
        {
            return rhs.dist < dist;
        }
        HeapNode(int u, int w): from(u), dist(w) {}
    };

    void dijkstra(int s)
    {
        priority_queue<HeapNode> Q;
        for (int i = 0; i <= n; i++) d[i] = INF;
        memset(vis, 0, sizeof(vis));
        d[s] = 0;
        Q.push(HeapNode(s, 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];
                    Q.push(HeapNode(e.to, d[e.to]));
                }
            }
        }
    }
};

int n, m, s;
Dijkstra solve;

int main()
{
    while(~scanf("%d%d%d", &n, &m, &s))
    {
        solve.init(n);
        for (int i = 0; i < m; i++)
        {
            int p, q, t;
            scanf("%d%d%d", &p, &q, &t);
            solve.add_edge(p, q, t);
        }
        int w; scanf("%d", &w);
        while (w--)
        {
            int a; scanf("%d", &a);
            solve.add_edge(0, a, 0);//超级源点~起点，边权为0
        }
        solve.dijkstra(0);
        if (solve.d[s] == INF) printf("-1\n");
        else printf("%d\n", solve.d[s]);
    }
    return 0;
}
/*
5 8 5
1 2 2
1 5 3
1 3 4
2 4 7
2 5 6
2 3 5
3 5 1
4 5 1
2
2 3
4 3 4
1 2 3
1 3 4
2 3 2
1
1
*/

思路2：反向建图求s到所有点的最短路，然后取到所有起点的最小值就是答案。

反向建边：

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 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 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];            //标记数组
    int 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 from; int dist;
        bool operator < (const HeapNode& rhs) const
        {
            return rhs.dist < dist;
        }
        HeapNode(int u, int w): from(u), dist(w) {}
    };

    void dijkstra(int s)
    {
        priority_queue<HeapNode> Q;
        for (int i = 0; i <= n; i++) d[i] = INF;
        memset(vis, 0, sizeof(vis));
        d[s] = 0;
        Q.push(HeapNode(s, 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];
                    Q.push(HeapNode(e.to, d[e.to]));
                }
            }
        }
    }
};

int n, m, s;
Dijkstra solve;

int main()
{
    while(~scanf("%d%d%d", &n, &m, &s))
    {
        solve.init(n);
        for (int i = 0; i < m; i++)
        {
            int p, q, t;
            scanf("%d%d%d", &p, &q, &t);
            solve.add_edge(q, p, t);//反向建边
        }
        solve.dijkstra(s);

        int MIN = INF;
        int w; scanf("%d", &w);
        while (w--)
        {
            int a; scanf("%d", &a);
            MIN = min(MIN, solve.d[a]);
        }
        if (MIN == INF) printf("-1\n");
        else printf("%d\n", MIN);
    }
    return 0;
}
/*
5 8 5
1 2 2
1 5 3
1 3 4
2 4 7
2 5 6
2 3 5
3 5 1
4 5 1
2
2 3
4 3 4
1 2 3
1 3 4
2 3 2
1
1
*/