模板
#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
int n,m,S,tot,Next[500010],head[20000],tree[500010],val[500010];
bool visit[20000];
long long dis[20000];
struct node
{
int u,dis;
}t;
struct cmp
{
bool operator()(node a,node b)
{
return a.dis>b.dis;
}
};
priority_queue<node,vector<node>,cmp> Q;
void add(int x,int y,int z)
{
tot++;
Next[tot]=head[x];
head[x]=tot;
tree[tot]=y;
val[tot]=z;
}
int main()
{
scanf("%d%d%d",&n,&m,&S);
tot=0;
for (int i=1;i<=m;i++)
{
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
if (x==y) continue;
add(x,y,z);
}
for (int i=1;i<=n;i++)
{
visit[i]=false;
dis[i]=2147483647;
}
t.u=S;t.dis=0;
dis[S]=0;
Q.push(t);
while (!Q.empty())
{
t=Q.top();
Q.pop();
int u=t.u;
if (visit[u]) continue;
visit[u]=true;
for (int i=head[u];i;i=Next[i])
{
int v=tree[i];
if (!visit[v]&&dis[v]>dis[u]+(long long)val[i])
{
dis[v]=dis[u]+val[i];
t.u=v;t.dis=dis[u]+val[i];
Q.push(t);
}
}
}
for (int i=1;i<=n-1;i++) printf("%lld ",dis[i]);
printf("%lld\n",dis[n]);
return 0;
}