##Dijkstra Template

\ (Dijkstra \) template

Feeling going engraved in DNA inside ...

#include<bits/stdc++.h>
using namespace std;
const int N=100005,INF=0x3f3f3f3f;
int n,m,s,d[N];

inline int read()
{
    char c=getchar();int x=0;
    for(;!isdigit(c);c=getchar());
    for(;isdigit(c);c=getchar())
        x=x*10+c-'0';
    return x;
}

struct node
{
    int w,v;
    node(int a,int b )
    {
        w=a;
        v=b;
    }
};
vector<node>G[N];
priority_queue< pair<int,int> > Q;
bool vis[N];
void Dijk()
{
    memset(d,0x3f,sizeof(d));
    d[s]=0;
    Q.push( make_pair(0,s));

    while(!Q.empty())
    {
        int u=Q.top().second;
        Q.pop();
        if(vis[u])continue;
        vis[u]=1;
        for(int i=0;i<G[u].size();i++)
        {
            int v=G[u][i].v,w=G[u][i].w;
            if(d[v]>d[u]+w)
            {
                d[v]=d[u]+w;
                Q.push(make_pair(-d[v],v));
            }
        }
    }
}

int main()
{
    n=read();
    m=read();
    s=read();
    for(int i=1;i<=m;i++)
    {
        int u=read();
        int v=read();
        int w=read();
        G[u].push_back(node(w,v));
    }
    Dijk();
    for(int i=1;i<=n;i++)
        printf("%d ",d[i]);

    return 0;
}