2018 南京网络赛 L. Magical Girl Haze【Dij+分层图】

L. Magical Girl Haze；
题意：一张有向图，求1~n的最短路，你可以使路径中的k条边权值为0；
分析：建一张$(k + 1) * n$个点的有向图，k+1层。
每层为原图只是点的编号对应放大，层与层之间的边权值可以为0，最后1->(k + 1) * n这条Dij路径即为答案。

#pragma GCC optimize ("O3")
#pragma GCC optimize ("O2")
#include <bits/stdc++.h>
using namespace std;
#define met(s) memset(s, 0, sizeof(s))
#define rep(i, a, b) for(int i = a; i <= b; ++i)
template <class T> inline void scan_d(T &ret) {
char c; ret = 0;
while ((c = getchar()) < '0' || c > '9');
while (c >= '0' && c <= '9') { 
ret = ret * 10 + (c - '0'), c = getchar();}}
typedef long long LL;
typedef unsigned long long ull;
typedef pair<LL, int> pii;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const int MAXN = 5400000;
LL dis[3200010]; int head[3200010];
int n, m, k, cnt;

struct node {
    int to, val, next;
}edge[MAXN];

void add(int u, int v, int val) {
    edge[cnt].to = v;
    edge[cnt].val = val;
    edge[cnt].next = head[u];
    head[u] = cnt++;
}

void dij(int st, int ed) {
    priority_queue<pii, vector<pii>, greater<pii> > que;
    dis[st] = 0;
    que.push(pii(0, st));
    while(!que.empty()) {
        pii p = que.top();
        que.pop();
        int v = p.second;
        if(dis[v] < p.first) continue;
        for(int i = head[v]; ~i; i = edge[i].next) {
            int e = edge[i].to;
            if(dis[v] + edge[i].val < dis[e]) {
                dis[e] = dis[v] + edge[i].val;
                que.push(pii(dis[e], e));
            }
        }
    }
    printf("%lld\n", dis[ed * (k + 1)]);
}

int main() {
    int T; scanf("%d", &T);
    while(T--) {
        scanf("%d %d %d", &n, &m, &k);
        for(int i = 1; i <= n * (k + 1); ++i) {
            dis[i] = INF;
            head[i] = -1;
        }
        int a, b, c; cnt = 0;
        for(int i = 0; i < m; ++i) {//关键是建分层图
            scan_d(a); scan_d(b); scan_d(c);
            for(int j = 0; j <= k; ++j) {
                add(a + j * n, b + j * n, c);
                if(j < k) add(a + j * n, b + (j + 1) * n, 0);
            }
        }
        dij(1, n);
    }
    return 0;
}