P4568 [JLOI2011]飞行路线（分层图最短路）

本文链接：https://blog.csdn.net/qq_39641976/article/details/113000618

题目大意：
给定一张 $n$ 个点， $m$ 条边的无向图，现在可以 $0$ 距离走 $k$ 条边，求从给定起点到给定终点的最短路距离

题目分析：
将最短路分层，层与层之间转移的那条边权值为 $0$ ，之前的 $d i s []$ 要改为 $d i s [i] []$ 表示走了 $i$ 条 $0$ 距离的边
要注意一个细节，最短路不一定要用玩 $k$ 次机会，故不一定在 $d i s [k] []$ 中取到

具体细节见代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#include<map>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
int read()
{
	int res = 0,flag = 1;
	char ch = getchar();
	while(ch<'0' || ch>'9')
	{
		if(ch == '-') flag = -1;
		ch = getchar();
	}
	while(ch>='0' && ch<='9')
	{
		res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
		ch = getchar();
	}
	return res*flag;
}
const int maxn = 1e5+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
struct Edge{
	int nxt,to,val;
}edge[maxn];
int n,m,k,head[maxn],cnt,dis[25][maxn];
bool vis[25][maxn];
void addedge(int from,int to,int val)
{
	edge[++cnt].nxt = head[from];
	edge[cnt].to = to;
	edge[cnt].val = val;
	head[from] = cnt;
}
void dijkstra(int u)
{
	priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>qu;
	memset(dis,127,sizeof(dis));
	dis[0][u] = 0;
	qu.push(make_pair(0,u));
	while(!qu.empty())
	{
		int h = qu.top().second;
		qu.pop();
		int level = h/(n+1); h %= (n+1);
		if(vis[level][h]) continue;
		vis[level][h] = true;
		for(int i = head[h];i;i = edge[i].nxt)
		{
			int to = edge[i].to,val = edge[i].val;
			if(dis[level][to] > dis[level][h]+val)
			{
				dis[level][to] = dis[level][h]+val;
				qu.push(make_pair(dis[level][to],to+level*(n+1)));
			}
			if(level == k) continue;
			if(dis[level+1][to] > dis[level][h])
			{
				dis[level+1][to] = dis[level][h];
				qu.push(make_pair(dis[level+1][to],to+(level+1)*(n+1)));
			}
		}
	}
}

int main()
{
	n = read(),m = read(),k = read();
	int st = read(),en = read();
	for(int i = 1;i <= m;i++)
	{
		int from = read(),to = read(),val = read();
		addedge(from,to,val);
		addedge(to,from,val);
	}
	dijkstra(st);
	int ans = inf;
	for(int i = 0;i <= k;i++) ans = min(ans,dis[i][en]);
	printf("%d\n",ans);
	return 0;
}