0分求调必关

#include<bits/stdc++.h>
#define N 100010
#define M 200010
using namespace std;
struct edge{
	int to;
	int next;
	int dis;
};
struct node{
	int dis;
	int pos;
	bool operator <(const node&x)const{
		return x.dis<dis;
	}
};
priority_queue<node> p;
edge e[M];
int head[N];
int dis[N];
int cnt;
bool vis[N];
int n,m,s;
void add_edge(int u,int v,int d){
	cnt++;
	e[cnt].dis=d;
	e[cnt].to=v;
	e[cnt].next=head[u];
	head[u]=cnt;
}
void djst(){
	dis[s]=0;
	p.push((node){0,s});
	while(!p.empty()){
		node tmp=p.top();
		p.pop();
		int x=tmp.pos;
		int d=tmp.dis;
		if(vis[x])continue;
		vis[x]=1;
		for(int i=head[x];i;i=e[i].next){
			int y=e[i].to;
			if(dis[y]>dis[x]+e[i].dis){
				dis[y]=dis[x]+e[i].dis;
				if(!vis[y])
					p.push((node){dis[y],y});
			}
		}
	}
}
int main(){
	cin>>n>>m>>s;
	for(int i=1;i<=n;i++)dis[i]=0x7fffffff;
	for(int i=1;i<=m;i++){
		int u,v,d;
		cin>>u>>v>>d;
		add_edge(u,v,d);
	}
	djst();
	for(int i=1;i<=n;i++)cout<<dis[i]<<" ";
	return 0;
}