0荤求调

#include<bits/stdc++.h>
using namespace std;
int n,m,s,t,to;
int u,v,r;
struct E{
    int too,right;
};
bool b[600009];
vector<E> q[600009];
int di[600009];
int main(){
    cin >>n>>m>>s;
    for(int i=0;i<m;i++){
        cin >>u>>v>>r;
        q[u].push_back({v,r});
        //q[v].push_back({u,r});
    }
    //b[s]=1;
    for(int i=1;i<=n;i++){
        di[i]=2147483647;
    }
    di[s]=0;
    while(1){
        int p=-1;
        int minn=2000000009;
        for(int i=1;i<=n;i++){
            if(b[i]==0 && di[i]<minn){
                minn=di[i];
                p=i;
            }
        }
        
        if(p==-1){
            break;
        }
        b[p]=1;
        for(int i=0;i<q[p].size();i++){
            to=q[p][i].too;
            if(b[to]){
                continue;
            }
            r=q[p][i].right;
            di[to]=min(di[to],r+di[p]);
        }
    }
    for(int i=1;i<=n;i++){
        cout<<di[i]<<" ";
    }
    return 0;
}