#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
const int N=1000100;
ll h[N],ne[N],w[N],e[N],dist[N];
ll n,m,idex;
bool st[N];
void add(ll a,ll b,ll c)
{
    e[idex]=b;
    ne[idex]=h[a];
    w[idex]=c;
    h[a]=idex++;
}
void dijkstra()
{
    memset(dist,0x3f,sizeof dist);
    priority_queue<pii,vector<pii>,greater<pii>> heap;
    dist[1]=0;
    heap.push({0,1});
    while(heap.size())
    {
        auto t=heap.top();
        heap.pop();
        ll ver=t.second,distance=t.first;
        if(st[ver]) continue;
        st[ver]=true;
        for(ll i=h[ver];i!=-1;i=ne[i])
        {
            ll j=e[i];
            if(dist[j]>distance+w[i])
            {
                dist[j]=distance+w[i];
                heap.push({dist[j],j});
            }
        }
    }
}
int main()
{
    scanf("%lld%lld",&n,&m);
    memset(h,-1,sizeof h);
    while(m--)
    {
        ll a,b,c;
        scanf("%lld%lld%lld",&a,&b,&c);
        add(a,b,c);
    }
    dijkstra();
    for(ll i=1;i<=n;i++)
    {
        if(dist[i]==0x3f3f3f3f) printf("-1\n");
        else printf("%lld ",dist[i]);
    }
    return 0;
}```

[评测结果](https://www.luogu.com.cn/record/55335717)