个人链式前向星迪杰斯特拉模板

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
#define IOS ios_base::sync_with_stdio(0);
const int N=400005;
int vis[N];
int w1[N],e1[N],ne1[N],h1[N],dist1[N],idx1;
void add(int a,int b,int c,int w[],int e[],int ne[],int h[],int &idx){
//数组名字后面加[]代表推入的是数组
//idx前面的为直接引用，及传入指针
	e[idx]=b;
	w[idx]=c;
	ne[idx]=h[a];
	h[a]=idx++;
}
void dijkstra(int x,int dist[],int w[],int e[],int ne[],int h[]){
	memset(vis,0,sizeof vis);
	dist[x]=0;
	priority_queue<PII,vector<PII>,greater<PII> >q;
	q.push({0,x});
	while(!q.empty()){
		int t=q.top().second;
		q.pop();
		if(vis[t])continue;
		vis[t]=1;
		for(int i=h[t];i!=-1;i=ne[i]){
			int j=e[i];
			if(dist[j]>dist[t]+w[i]){
				dist[j]=dist[t]+w[i];
				q.push({dist[j],j});
			}
		}
	}
}
signed main(){
	cin >> n >> m;
	int a,b,c;
	memset(h1,-1,sizeof (h1));
	memset(dist1,0x3f,sizeof dist1);
	while(m--){
		cin >> a >> b >> c ;
		add(a,b,c,w1,e1,ne1,h1,idx1);
	}
	dijkstra(1,dist1,w1,e1,ne1,h1);
	for(int i=1;i<=n;i++){
		cout << dist1[i] << " ";
	}
	return 0;
}