题意: 给出一个n个点图,你可以让你路径上k条边的权值变为0,求从s到e的最小权值。(1<=n,k<=1e3)
思路: 分层图最短路裸题。
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e3 + 10, M = 2e6 + 10;
ll dis[N][N];
int h[M], cnt, n, m, s, e, k;
struct pont {
int v, net, w;
} no[M];
struct node {
ll p, k, d;
bool operator<(const node&a)const {
return d > a.d;
}
};
void add(int u, int v, int w) {
no[cnt].v = v;
no[cnt].w = w;
no[cnt].net = h[u];
h[u] = cnt++;
}
ll dij(int n) {
memset(dis, 0x3f, sizeof dis);
priority_queue<node> q;
q.push((node) {
s, 0, 0
});
dis[s][0] = 0;
while(!q.empty()) {
node e = q.top();
q.pop();
if(e.d != dis[e.p][e.k])
continue;
if(e.p == n)
return e.d;
for(int i = h[e.p]; ~i; i = no[i].net) {
if(dis[no[i].v][e.k] > dis[e.p][e.k] + no[i].w) {
dis[no[i].v][e.k] = dis[e.p][e.k] + no[i].w;
q.push((node) {
no[i].v, e.k, dis[no[i].v][e.k]
});
}
if(e.k < k && dis[no[i].v][e.k + 1] > dis[e.p][e.k]) {
dis[no[i].v][e.k + 1] = dis[e.p][e.k];
q.push((node) {
no[i].v, e.k + 1, dis[no[i].v][e.k + 1]
});
}
}
}
}
int main() {
memset(h, -1, sizeof h);
cin >> n >> m >> s >> e >> k;
for(int v, u, w, i = 1; i <= m; i++)
scanf("%d%d%d", &u, &v, &w), add(u, v, w), add(v, u, w);
cout << dij(e) << endl;
return 0;
}