我们把原图复制出k层,而题中给的k次免费机会,就是连接不同层次图的道路,并且遍权为0。
使用免费机票的时候,就跳到上面那一层,并且没有任何花费。
这样求一遍最短路就可以得到使用免费机票次数小于等于k的最短路
也可以从dp的角度理解:
dp[v][i] = min(dp[v][i], dp[u][i] + c)
同层图转移
dp[v][i+1] = min(dp[u][i], dp[v][i+1]) i < k
分层图转移
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
#define debug(x) cerr << #x << "=" << x << endl;
const int INF = (1<<30) - 10;
const int MAXN = 10000 + 10;
const int MAXM = 2*50000 + 10;
int n,m,k,tot,last[MAXN],ans,d[MAXN][11],s,t,vis[MAXN][11];
struct Node {
int id,dis,level;
Node(int id, int dis, int level) : id(id), dis(dis), level(level) {}
bool operator < (const Node &a) const {
return dis > a.dis;
}
};
priority_queue<Node> q;
struct Edge {
int u,v,c,to;
Edge(){}
Edge(int u, int v, int c, int to) : u(u), v(v), c(c), to(to) {};
}e[MAXM];
inline void add(int u, int v, int c){
e[++tot] = Edge(u,v,c,last[u]);
last[u] = tot;
}
inline void rd(int &x) {
x = 0;
char ch = getchar();
while(ch < '0' || ch > '9') ch = getchar();
while(ch >= '0' && ch <='9') x = x * 10 + ch - '0', ch = getchar();
return;
}
void dijkstra() {
for(int i=0; i<n; i++)
for(int j=0; j<=k; j++)
d[i][j] = INF;
d[s][0] = 0;
q.push(Node(s,0,0));
while(!q.empty()) {
Node now = q.top();
q.pop();
int u = now.id, lv = now.level;
if(vis[u][lv]) continue;
vis[u][lv] = 1;
for(int i=last[u]; i; i=e[i].to) {
int v = e[i].v;
int c = e[i].c;
if(d[u][lv] + c < d[v][lv]) {
d[v][lv] = d[u][lv] + c;
q.push(Node(v,d[v][lv],lv));
}
if(lv < k) {
if(d[u][lv] < d[v][lv+1]) {
d[v][lv+1] = d[u][lv];
q.push(Node(v,d[v][lv+1],lv+1));
}
}
}
}
}
int main() {
rd(n), rd(m), rd(k);
rd(s), rd(t);
for (int i = 1; i <= m; i++) {
int a, b, c;
rd(a), rd(b), rd(c);
add(a, b, c);
add(b, a, c);
}
dijkstra();
ans = INF;
for(int i=0; i<=k; i++) {
ans = min(ans, d[t][i]);
}
printf("%d", ans);
return 0;
}