P4779 【模板】单源最短路径（标准版）

#include <bits/stdc++.h>
#define int long long
#define MAXM 200010
#define MAXN 100010
using namespace std;
struct edge
{
	int next,to,v;
} e[MAXM];
int h[MAXN],ei=0;
inline void add(int x,int y,int v)
{
	ei++;
	e[ei].v = v;
	e[ei].to = y;
	e[ei].next =h[x];
	h[x] = ei;
}
int dis[MAXN],u[MAXN];
struct node
{
	int id,v;
	bool operator <(const node & x) const
	{
		return v>x.v;
	}
};
void dij(int f)
{
	priority_queue<node>qu;
	memset(dis,0x3f,sizeof(dis));
	node f1;
	f1.id = f;
	f1.v = 0;
	dis[f] = 0;
	qu.push(f1);
	while(!qu.empty())
	{
		int id = qu.top().id;
		qu.pop();
		if(u[id]==1) continue;		
		u[id] = 1;
		for(int i=h[id];i;i=e[i].next)
		{
			int to = e[i].to;
			if(u[to]==1) continue;
			if(dis[to]>dis[id]+e[i].v)
			{
				dis[to] = dis[id]+e[i].v;
				node f2;
				f2.id = to;
				f2.v = dis[to];
				qu.push(f2);
			}
		}
	}
}
signed main()
{
	int n,m,s;
	cin>>n>>m>>s;
	for(int i=1;i<=m;i++)
	{
		int x,y,v;
		scanf("%lld%lld%lld",&x,&y,&v);
		add(x,y,v); 
	} 
	dij(s);
	for(int i=1;i<=n;i++)
	{
		printf("%lld ",dis[i]);
	} 
	return 0;
}