[分层最短路板子] 洛谷 P4568

题目

题目链接：https://www.luogu.com.cn/problem/P4568

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int head[100010],dis[50100][15];
bool vis[50010][12];
struct sut{
	int to;
	int next;
	int val;
}edge[100010];
int tot=0;
void add_edge(int u,int v,int w){
	edge[++tot].to=v;
	edge[tot].val=w;
	edge[tot].next=head[u];
	head[u]=tot;

}
int n,m,k;
void dij(int s){
	memset(dis,INF,sizeof dis);
	dis[s][0]=0;
	priority_queue<pair<int,int>> q;
	q.push({0,s});
	while(!q.empty()){
		int now =q.top().second;
		q.pop();
		int c= now/n;
		now%=n;
	//	cout<<c<<endl;
		if(vis[now][c]) continue;
		vis[now][c]=1;
		for(int i=head[now];i;i=edge[i].next){
			//cout<<i<<endl;
			int v=edge[i].to;
			if(!vis[v][c]&&dis[v][c]>dis[now][c]+edge[i].val){
				dis[v][c]=dis[now][c]+edge[i].val;
				q.push({-dis[v][c],v+n*c});
			}
		}
		if(c<k){
			for(int i=head[now];i;i=edge[i].next){
			int v=edge[i].to;
			if(!vis[v][c+1]&&dis[v][c+1]>dis[now][c]){
				dis[v][c+1]=dis[now][c];
				q.push({-dis[v][c+1],v+n*(c+1)});
				}
			}
		}
	}
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n>>m>>k;
	int s,t;
	cin>>s>>t;
	for(int i=1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		add_edge(u,v,w);
		add_edge(v,u,w);
	}
	dij(s);
	int ans=INF;
	for(int i=0;i<=k;i++){
		ans=min(ans,dis[t][i]);
	}
	cout<<ans<<endl;
    return 0;
}