my code:

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int inf=0x7fffffff;
const int N=1e4+2;
const int M=5e5+5;
int head[N],ver[M],edge[M],nxt[M],cnt;
int n,m,s,d[N];
bool v[N];
priority_queue<pair<int,int> >q;
void add(int x,int y,int w){
	ver[++cnt]=y;
	edge[cnt]=w;
	nxt[cnt]=head[x];
	head[x]=cnt;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);	
    cin>>n>>m>>s;
    for(int i=1;i<=m;i++){
    	int u,v,w;
    	cin>>u>>v>>w;
    	add(u,v,w);
	}
	for(int i=1;i<=n;i++)
	    d[i]=inf;
	d[s]=0;
	q.push({0,s});
	while(!q.empty()){
		int x=q.top().second;
		if(v[x]) continue;
		q.pop();
		v[x]=1;
		for(int i=head[x];i;i=nxt[i]){
			int y=ver[i],z=edge[i];
			if(d[y]>d[x]+z){
				d[y]=d[x]+z;
				q.push({-d[y],y});
			}
		}
	}
	for(int i=1;i<=n;i++){
		if(d[i]==inf) cout<<inf;
		else cout<<d[i];
		if(i!=n) cout<<" ";
	}
	return 0;
}