大佬题解:https://www.acwing.com/solution/content/21233/
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define x first
#define y second
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
const int N = 1010,M=100010;
int rh[N],h[N],e[M],ne[M],w[M],idx=0;
int dist[N];
bool st[N];
int S,T,K,n,m;
int cnt[N];
void add(int h[],int a,int b,int c)
{
e[idx]=b,w[idx]=c,ne[idx]=h[a],h[a]=idx++;
}
void dij()
{
memset(dist,0x3f,sizeof dist);
priority_queue<PII,vector<PII>,greater< > >heap;
heap.push({0,T});
dist[T]=0;
while(heap.size())
{
auto t=heap.top();
heap.pop();
int ver=t.y;
if(st[ver])continue;
st[ver]=true;
for(int i=rh[ver];i!=-1;i=ne[i])
{
int j=e[i];
if(dist[j]>dist[ver]+w[i])
{
dist[j]=dist[ver]+w[i];
heap.push({dist[j],j});
}
}
}
}
int Astar()
{
priority_queue<PIII,vector<PIII>,greater<PIII> > heap;
heap.push({dist[S],{0,S}});
while(heap.size())
{
auto t=heap.top();
heap.pop();
int ver=t.y.y,dis=t.y.x;
cnt[ver]++;
if(cnt[T]==K)return dis;
for(int i=h[ver];i!=-1;i=ne[i])
{
int j=e[i];
if(cnt[j]<K)
{
heap.push({dist[j]+w[i]+dis,{w[i]+dis,j}});
}
}
}
return -1;
}
int main()
{
memset(h, -1, sizeof h);
memset(rh,-1,sizeof rh);
cin>>n>>m;
while (m -- )
{
int a,b,c;
cin>>a>>b>>c;
add(h,a,b,c);
add(rh,b,a,c);
}
cin>>S>>T>>K;
if(S==T)K++;
dij();
cout<<Astar()<<endl;
}