【分层图 最短路】luogu_4568 [JLOI2011]飞行路线

题意

一张图，其中有$k$次免去一条边权机会，求最短路。

思路

分层图，将图分成$k+1$层，第$i$层代表用了$k$次机会，每层间用边权为$0$的边连接，跑一边最短路。
（建边建错调了好久？？！）

代码

#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>

int n, m, k, s, t, tot;
int ver[100001], next[100001], head[10001], edge[100001];
int dis[10001][11], vis[10001][11];

struct heap{
    int u, dis, used;
};

bool operator <(const heap &a, const heap &b) {
    return a.dis > b.dis;
}

void add(int u, int v, int w) {
    ver[++tot] = v;
    next[tot] = head[u];
    edge[tot] = w;
    head[u] = tot;
}

void dijkstra() {
    std::priority_queue<heap> q;
    memset(dis, 127 / 3, sizeof(dis));
    dis[s][0] = 0;
    q.push((heap){s, 0, 0});
    while (q.size()) {
        int u = q.top().u, rk = q.top().used;
        q.pop();
        if (vis[u][rk]) continue;
        vis[u][rk] = 1;
        for (int i = head[u]; i; i = next[i]) {
            int v = ver[i];
            if (rk < k && !vis[v][rk + 1] && dis[v][rk + 1] > dis[u][rk]) dis[v][rk + 1] = dis[u][rk], q.push((heap){v, dis[v][rk + 1], rk + 1});
            if (!vis[v][rk] && dis[v][rk] > dis[u][rk] + edge[i]) dis[v][rk] = dis[u][rk] + edge[i], q.push((heap){v, dis[v][rk], rk});
        }
    }
}

int main() {
    scanf("%d %d %d %d %d", &n, &m, &k, &s, &t);
    for (int i = 1, x, y, z; i <= m; i++)
        scanf("%d %d %d", &x, &y, &z), add(x, y, z), add(y, x, z);
    dijkstra();
    int ans = 2147483647;
    for (int i = 0; i <= k; i++)
        ans = std::min(dis[t][i], ans);
    printf("%d", ans);
}