BZOJ ~ 2763 ~ [JLOI2011]飞行路线 （分层图最短路，模板题）

思路：对于k次免费花费，我们可以把图想像为有k+1层，从第0层到第k层，第0层表示没有用过这k次机会，第i层表示用过i次免费花费。对于分层，有两种方法。本题为双向边。

注意：最后要从所有层中的终点找答案，因为如果s-t只有少于k条路，而你选取免费k次在到达终点的答案就可能不对。

1.建图时分层：建k+1层图。然后有边的两个点，多建一条到下一层边权为0的单向边，如果走了这条边就表示用了一次免费机会

比如共有N个点，1~n表示第一层，（1+n）~（n+n）代表第二层，（1+2*n）~（n+2*n）代表第三层，（1+i*n）~（n+i*n）代表第i层。

注意该种方法：因为要建K+1层图，数组要开到n*（k+1），点的个数也为n*（k+1）

给个图帮助理解：

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 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, 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, k, s, t;
Dijkstra solve;

int main()
{
    while(~scanf("%d%d%d", &n, &m, &k))
    {
        solve.init(n * 11);
        scanf("%d%d", &s, &t);
        while(m--)
        {
            int a, b, c;
            scanf("%d%d%d", &a, &b, &c);
            for (int i = 0; i <= k; i++)//k+1层图
            {
                //本层之间建图
                solve.add_edge(a + i * n, b + i * n, c);
                solve.add_edge(b + i * n, a + i * n, c);
                //该层与下一层建图
                if (i != k)//不是最后一层
                {
                    solve.add_edge(a + i * n, b + (i + 1) * n, 0);
                    solve.add_edge(b + i * n, a + (i + 1) * n, 0);
                }
            }
        }
        solve.dijkstra(s);
        int MIN = INF;
        for (int i = 0; i <= k; i++)
        {
            MIN = min(MIN, solve.d[t + i * n]);
        }
        printf("%d\n", MIN);
    }
    return 0;
}
/*
5 6 1
0 4
0 1 5
1 2 5
2 3 5
3 4 5
2 3 3
0 2 100
*/

2.跑最短路时分层计算：把dis数组多开一维表示花费了几次免费机会，标记数组同样也多开一维。更新的时候先更新同层之间（即花费免费机会相同）的最短路，然后更新从该层到下一层（即再花费一次免费机会）的最短路。

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int MAXK = 15;
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数组中的序号
    bool vis[MAXN][MAXK];          //标记数组
    int d[MAXN][MAXK];              //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, dist, cost;
        bool operator < (const HeapNode& rhs) const
        {
            return rhs.dist < dist;
        }
        HeapNode(int u, int w, int c): from(u), dist(w), cost(c) {}
    };

    void dijkstra(int s, int k)
    {
        priority_queue<HeapNode> Q;
        memset(d, 127, sizeof(d));//将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])
                    {
                        d[e.to][c + 1] = d[u][c];
                        Q.push(HeapNode(e.to, d[e.to][c + 1], c + 1));
                    }
                }
            }
        }
    }
};

int n, m, k, s, t;
Dijkstra solve;

int main()
{
    while(~scanf("%d%d%d", &n, &m, &k))
    {
        solve.init(n);
        scanf("%d%d", &s, &t);
        while(m--)
        {
            int a, b, c;
            scanf("%d%d%d", &a, &b, &c);
            solve.add_edge(a, b, c);
            solve.add_edge(b, a, c);
        }
        solve.dijkstra(s, k);
        int MIN = INF;
        for (int i = 0; i <= k; i++)
        {
            MIN = min(MIN, solve.d[t][i]);
        }
        printf("%d\n", MIN);
    }
    return 0;
}
/*
5 6 1
0 4
0 1 5
1 2 5
2 3 5
3 4 5
2 3 3
0 2 100
*/