A*算法——第k短路

题目链接

题目描述

“Good man never makes girls wait or breaks an appointment!” said the mandarin duck father. Softly touching his little ducks’ head, he told them a story.
“Prince Remmarguts lives in his kingdom UDF – United Delta of Freedom. One day their neighboring country sent them Princess Uyuw on a diplomatic mission.”
“Erenow, the princess sent Remmarguts a letter, informing him that she would come to the hall and hold commercial talks with UDF if and only if the prince go and meet her via the K-th shortest path. (in fact, Uyuw does not want to come at all)”
Being interested in the trade development and such a lovely girl, Prince Remmarguts really became enamored. He needs you - the prime minister’s help!
DETAILS: UDF’s capital consists of N stations. The hall is numbered S, while the station numbered T denotes prince’ current place. M muddy directed sideways connect some of the stations. Remmarguts’ path to welcome the princess might include the same station twice or more than twice, even it is the station with number S or T. Different paths with same length will be considered disparate.

输入描述

The first line contains two integer numbers N and M (1 ≤ N ≤ 1000,0 ≤ M ≤ 100000). Stations are numbered from 1 to N. Each of the following M lines contains three integer numbers A, B and T (1 ≤ A,B ≤ N,1 ≤ T ≤ 100). It shows that there is a directed sideway from A-th station to B-th station with time T.
The last line consists of three integer numbers S, T and K (1 ≤ S,T ≤ N,1 ≤ K ≤ 1000).

输出描述

A single line consisting of a single integer number: the length (time required) to welcome Princess Uyuw using the K-th shortest path. If K-th shortest path does not exist, you should output “-1” (without quotes) instead.

示例

输入

2 2
1 2 5
2 1 4
1 2 2

输出

14

#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 1e3 + 10;
int n,m,d,k;
int dis[maxn],vis[maxn],cnt[maxn];

struct node1{
	int u;
	int w;
};

vector<node1> g[maxn],rg[maxn];

struct node2{
	int u;
	int len;
	friend bool operator < (node2 x,node2 y)
	{
		// <为从大到小排列，>为从小到大排列 
		return x.len + dis[x.u] > y.len + dis[y.u];
	}
};

void spfa(int s)	// 求最短路 
{
	memset(dis,inf,sizeof(dis));
	memset(vis,0,sizeof(vis));
	queue<int> q;
	dis[s] = 0;
	q.push(s);
	while(!q.empty()){
		int p = q.front();
		q.pop();
		vis[p] = 0;
		for(int i = 0 ; i < rg[p].size() ; i++){	// 跑反向边 
			if(dis[rg[p][i].u] > dis[p] + rg[p][i].w){
				dis[rg[p][i].u] = dis[p] + rg[p][i].w;
				if(!vis[rg[p][i].u]){
					vis[rg[p][i].u] = 1;
					q.push(rg[p][i].u);
				}
			}
		}
	}
}

int A_star(int s)
{
	if(dis[s] == inf) return -1;
	priority_queue<node2> q;
	memset(cnt,0,sizeof(cnt));
	q.push({s,0});
	while(!q.empty()){
		node2 p = q.top();
		q.pop();
		cnt[p.u]++;
		if(cnt[d] == k) return p.len;	// 到达终点次数等于 k，则返回 p.len 
		for(int i = 0 ; i < g[p.u].size() ; i++){	// 跑正向边 
			int v = g[p.u][i].u;
			q.push({v,p.len + g[p.u][i].w});
		}
	}
	return -1;
}

int main()
{
	cin >> n >> m;
	for(int  i = 0 ; i < m ; i++){
		int a,b,t;
		cin >> a >> b >> t;
		g[a].push_back({b,t});	// 正向建边 
		rg[b].push_back({a,t});	// 反向建边 
	}
	int s;
	cin >> s >> d >> k;
	if(s == d) k++;		// 起点终点重合 
	spfa(d);
	int ans = A_star(s);
	cout << ans << endl;
	return 0;
}