洛谷 P4568 [JLOI2011]飞行路线

题目：飞行路线

思路：建分层图，跑最短路。

代码：

#include<bits/stdc++.h>
using namespace std;

#define maxn 200000
#define maxm 500000
#define read(x) scanf("%d",&x)

struct Edge{
	int y,z;
	Edge(){}
	Edge(int yy,int zz) {
		y=yy,z=zz;
	}
};

struct Pair{
	int y,z;
	Pair(){}
	Pair(int yy,int zz) {
		y=yy,z=zz;
	}
	bool operator < (const Pair& oth) const {
		return z>oth.z;
	}
};


int n,m,K;
int S,T;

vector<Edge> g_[maxn+5];
vector<Edge> g[maxn+5];

int getid(int x,int k) {
	return x+(k-1)*n;
}

void readin() {
	read(n),read(m),read(K);
	K++;
	read(S),read(T);
	S++,T++;
	S=getid(S,1),T=getid(T,K);
	for(int i=1;i<=m;i++) {
		int x,y,z;
		read(x),read(y),read(z);
		x++,y++;
		g_[x].push_back(Edge(y,z));
		g_[y].push_back(Edge(x,z));
	}
	
	for(int i=1;i<=n;i++) {
		for(int j=0;j<g_[i].size();j++) {
			int y=g_[i][j].y,z=g_[i][j].z;
			for(int k=1;k<=K;k++) {
				g[getid(i,k)].push_back(Edge(getid(y,k),z));
				if(k!=K)  g[getid(i,k)].push_back(Edge(getid(y,k+1),0));
			}
		}
	}
	n*=K;
}

priority_queue<Pair> que;
int dist[maxn+5];
int vis[maxn+5];

int dijkstra() {
	for(int i=1;i<=n;i++) {
		dist[i]=(1e9);
	}
	que.push(Pair(S,0));
	dist[S]=0;
	
	while(!que.empty()) {
		int h=que.top().y;que.pop();
		if(vis[h]) continue;
		vis[h]=true;
		if(T==h) return dist[h];
		
		for(int i=0;i<g[h].size();i++) {
			if(dist[h]+g[h][i].z<dist[g[h][i].y]) {
				dist[g[h][i].y]=dist[h]+g[h][i].z;
				que.push(Pair(g[h][i].y,dist[g[h][i].y]));
			}
		}
	}
	return -1;
}

int main() {
	readin();
	int ans=dijkstra();
	printf("%d",ans);	
	return 0;
}