MZOJ
分层图,考虑两个变量 d i s [ u ] [ k ] dis[u][k] dis[u][k]走到了 u u u号点用了 k k k个血包丢掉的最小的生命
由于受 N O I 2018 NOI2018 NOI2018的影响此题也卡住了 S p f a Spfa Spfa三组,故考虑 D i j k s t r a Dijkstra Dijkstra
Code
#include<bits/stdc++.h>
#include<queue>
#define rep(i,a,b) for(register int (i)=(a);(i)<=(b);(i)++)
#define don(i,a,b) for(register int (i)=(a);(i)>=(b);(i)--)
using namespace std;
const int maxn=1e6+10;
const int maxm=1e3+10;
int n,m,k,cnt=0,st,en;
int head[maxn],vis[maxn][11],dis[maxn][11];
template <class t> inline void read(t &x) {
x=0;int f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
while(isdigit(ch)){x=10*x+ch-'0';ch=getchar();}
x*=f;
}
struct {
int v,w,nex;
}e[maxn<<1];
struct node{//优先队列的重载结构体
int u,num,dis;
node(int _u = 0,int _dis = 0,int _num = 0):u(_u),dis(_dis),num(_num){}
friend bool operator < (const node &A,const node &B){
return A.dis>B.dis;
}
};
void add(int u,int v,int w) {
e[++cnt].v=v;
e[cnt].w=w;
e[cnt].nex=head[u];
head[u]=cnt;
}
void readdata() {
read(n),read(m),read(k);
read(st),read(en);
rep(i,1,m) {
int x,y,z;
read(x),read(y),read(z);
add(x,y,z);add(y,x,z);
}
}
void Dijkstra() {
priority_queue<node> q;
dis[st][0]=0;
q.push(node(st,0,0));
while(q.size()) {
node s=q.top();
q.pop();
int u=s.u,num=s.num;
if(vis[u][num]) continue;
vis[u][num]=true;
for(int i=head[u];i;i=e[i].nex) {
int v=e[i].v;
if(dis[v][num]>dis[u][num]+e[i].w) {//不打血包
dis[v][num]=dis[u][num]+e[i].w;//Spfa的松弛操作
if(!vis[v][num]) q.push(node(v,dis[v][num],num));
}
if(num+1<=k && dis[v][num+1]>dis[u][num]) {//打血包,前提是num+1<=k
dis[v][num+1]=dis[u][num];
if(!vis[v][num+1]) q.push(node(v,dis[v][num+1],num+1));
}
}
}
}
void work() {
memset(dis,0x7f,sizeof(dis));
memset(vis,false,sizeof(vis));
Dijkstra();
int minn=INT_MAX;
rep(i,0,k) minn=min(dis[en][i],minn);
printf("%d",minn);
}
int main() {
freopen("a.txt","r",stdin);
readdata();
work();
return 0;
}