洛谷p1339 dijkstra

 

P1339 [USACO09OCT] Heat Wave G - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

没什么多说的哈，一道模板，dijkstra的堆优化，注意不要和本蒟蒻一样用floyd，否则很容易tle

#include<iostream>
#include<cstring>
#include<queue>
#include<cmath>
#include<utility>
#include<algorithm>
using namespace std;
using ll = long long;
const int N=100010,M=100010;
int head[N],ver[M],edge[M],Next[M],d[N];
bool v[N];
int n,m,tot,s,t;
priority_queue<pair<int,int>>q;
void add(int x,int y,int z){
	ver[++tot]=y,edge[tot]=z,Next[tot]=head[x],head[x]=tot;
}
void dijkstra(){
	memset(d,0x3f,sizeof(d));;
	memset(v,0,sizeof(v));
	
	d[s]=0;
	q.push(make_pair(0,s));
	while(q.size()){
		int x=q.top().second;
		q.pop();
		if(v[x])continue;
		v[x]=1;
		for(int i=head[x];i;i=Next[i]){
			int y=ver[i],z=edge[i];
			if(d[y]>d[x]+z){
				d[y]=d[x]+z;
				q.push(make_pair(-d[y],y));
			}
		}
	}
	
}
int main ( ){
	ios::sync_with_stdio ( 0 ) , cin.tie ( 0 ) , cout.tie ( 0 );
	cin>>n>>m;
	cin>>s>>t;
	for(int i=1;i<=m;i++){
		int x,y,z;
		cin>>x>>y>>z;
		add(x,y,z);
		add(y,x,z);
	}
	dijkstra();
	cout<<d[t];
	return 0;
}