标准版Ac,弱化70WAWAWA求调

#include<bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define int long long
int n,m,s,u,v,w;
int cnt,head[100005];
int dist[100005],vis[100005];
struct Edge{
	int to,dis,next;
}edge[200005];
void Add_edge(int from,int to,int w)
{
	edge[++cnt].to=to;
	edge[cnt].dis=w;
	edge[cnt].next=head[from];
	head[from]=cnt;
}
struct node{
	int id,dis;
	bool operator < (const node &a)const{ return a.dis<dis;}
};
void Dijkstra()
{
	priority_queue<node> q;
	q.push(node {s,0});
	for(int i=1;i<=n;i++) dist[i]=INF;
	dist[s]=0;
	while(!q.empty())
	{
		node a=q.top();q.pop();
		int now=a.id;
		if(vis[now]) continue;
		vis[now]=1;
		for(int i=head[now];i;i=edge[i].next)
		{
			int j=edge[i].to;
			if(dist[now]+edge[i].dis<dist[j]){
				dist[j]=dist[now]+edge[i].dis;
				q.push(node{j,dist[j]});
			}
			 
		}
	}
}
signed main()
{
	cin>>n>>m>>s;
	for(int i=1;i<=m;i++){
		scanf("%d%d%d",&u,&v,&w);
		Add_edge(u,v,w);
	}
	Dijkstra();
	for(int i=1;i<=n;i++){
		if(s==i) cout<<0<<" ";
		else cout<<dist[i]<<" ";
	}
	return 0;
}