#include<bits/stdc++.h>
using namespace std;
int head[1000000],cnt=0;
long long ans[1000000];
bool vis[1000000];
struct data{
	int to,nextt,wei;
}edge[1000000];
void addedge(int x,int y,int z){
	edge[++cnt].to=y;
	edge[cnt].wei=z;
	edge[cnt].nextt=head[x];
	head[x]=cnt;
}
int n,m,s;
int main(){
	cin>>n>>m>>s;
	for(int i=1;i<=n;i++){
		ans[i]=2123456789;
	} 
	ans[s]=0;
	for(int i=1;i<=m;i++){
		int a,b,c;
		cin>>a>>b>>c;
		addedge(a,b,c);
	}
	int pos=s;
	int minn=2123456789;
	while(vis[pos]==0){
		vis[pos]=1;
		for(int i=head[pos];i!=0;i=edge[i].nextt){
			if(!vis[edge[i].to]&&ans[edge[i].to]>ans[pos]+edge[i].wei)
			    ans[edge[i].to]=ans[pos]+edge[i].wei;
		}
		for(int i=1;i<=m;i++){
			if(ans[i]<minn&&!vis[i]){
				pos=i;
				minn=ans[i];
			}
		}
	}
	for(int i=1;i<=m;i++){
		cout<<ans[i]<<" ";
	}
	cout<<endl;
	return 0;
}

楼主刚学Dijkstra，尝试写了一边，结果没过样例，求调求帮助