HDU ~ 3499 ~ Flight （分层图最短路）

题意：n个城市m条单向边！！！然后给你这M条单向边。最后输入起点终点，你有一次机会可以使某条边的花费减半，问起点到的最短路为多少？如果没有路可以到达输出“-1”。

思路：同BZOJ ~ 2763, 字符串的话用map映射一下就好了。注意要用long long。

建图分层：

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
const long long INF = 9187201950435737471;
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数组中的序号
    bool vis[MAXN];            //标记数组
    long long d[MAXN];              //s到各个点的最短路

    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; long long dist;
        bool operator < (const HeapNode& rhs) const
        {
            return rhs.dist < dist;
        }
        HeapNode(int u, long long w): from(u), dist(w) {}
    };

    void dijkstra(int s)
    {
        priority_queue<HeapNode> Q;
        memset(d, 127, sizeof(d));
        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;
                    Q.push(HeapNode(e.to, d[e.to]));
                }
            }
        }
    }
};

int n, m;
string s, e;
Dijkstra solve;

int main()
{
    while(~scanf("%d%d", &n, &m))
    {
        solve.init(n * 2);
        map<string, int> M;
        int cnt = 0;
        while(m--)
        {
            string u, v; int w;
            cin >> u >> v >> w;
            if (!M.count(u)) M[u] = cnt++;
            if (!M.count(v)) M[v] = cnt++;
            //第一层建边
            solve.add_edge(M[u], M[v], w);
            //第二层建边
            solve.add_edge(M[u] + n, M[v] + n, w);
            //第一层到第二层建边
            solve.add_edge(M[u], M[v] + n, w / 2);
        }

        cin >> s >> e;
        if (!M.count(s) || !M.count(e))
        {
            printf("-1\n");
            continue;
        }
        solve.dijkstra(M[s]);
        printf("%lld\n", solve.d[M[e] + n]);
    }
    return 0;
}
/*
4 4
Harbin Beijing 500
Harbin Shanghai 1000
Beijing Chengdu 600
Shanghai Chengdu 400
Harbin Chengdu

4 0
Harbin Chengdu
*/

最短路时分层计算：

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int MAXK = 5;
const long long INF = 9187201950435737471;
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数组中的序号
    bool vis[MAXN][MAXK];          //标记数组
    long long d[MAXN][MAXK];              //s到各个点的最短路

    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, long long dist)
    {
        edges.push_back(Edge(from, to, dist));
        m = edges.size();
        G[from].push_back(m - 1);
    }

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

    void dijkstra(int s, int k)
    {
        priority_queue<HeapNode> Q;
        memset(d, 127, sizeof(d));
        memset(vis, 0, sizeof(vis));
        d[s][0] = 0;
        Q.push(HeapNode(s, 0, 0));
        while (!Q.empty())
        {
            HeapNode x = Q.top(); Q.pop();
            int u = x.from, c = x.cost;
            if (vis[u][c]) continue;
            vis[u][c] = true;
            //本层最短路更新
            for (int i = 0; i < G[u].size(); i++)
            {
                Edge& e = edges[G[u][i]];
                if (d[e.to][c] > d[u][c] + e.dist)
                {
                    d[e.to][c] = d[u][c] + e.dist;
                    Q.push(HeapNode(e.to, d[e.to][c], c));
                }
            }
            //本层到下一层最短路更新
            if (c < k)//不是最后一层
            {
                for (int i = 0; i < G[u].size(); i++)
                {
                    Edge& e = edges[G[u][i]];
                    if (d[e.to][c + 1] > d[u][c] + e.dist / 2)
                    {
                        d[e.to][c + 1] = d[u][c] + e.dist / 2;
                        Q.push(HeapNode(e.to, d[e.to][c + 1], c + 1));
                    }
                }
            }
        }
    }
};

int n, m;
string s, e;
Dijkstra solve;

int main()
{
    while(~scanf("%d%d", &n, &m))
    {
        solve.init(n);
        map<string, int> M;
        int cnt = 0;
        while(m--)
        {
            string u, v; int w;
            cin >> u >> v >> w;
            if (!M.count(u)) M[u] = cnt++;
            if (!M.count(v)) M[v] = cnt++;
            solve.add_edge(M[u], M[v], w);
        }

        cin >> s >> e;
        if (!M.count(s) || !M.count(e))
        {
            printf("-1\n");
            continue;
        }
        solve.dijkstra(M[s], 1);
        printf("%lld\n", solve.d[M[e]][1]);
    }
    return 0;
}
/*
4 4
Harbin Beijing 500
Harbin Shanghai 1000
Beijing Chengdu 600
Shanghai Chengdu 400
Harbin Chengdu

4 0
Harbin Chengdu
*/