36pts求调

#include<cstdio>
#include<queue>
#include<vector>
#include<algorithm>
#define ede first
#define dis second
using namespace std;
int n,m,s;
int u,v,w;
int dis[100025]; bool vis[100025];
int main(){
    scanf("%d %d %d",&n,&m,&s);
    vector<vector<pair<int,int>>>g(n+1);
    for(int i=1;i<=m;i++){
        scanf("%d %d %d",&u,&v,&w);
        g[u].push_back(make_pair(v,w));
        // printf("%d %d %d\n",u,g[u][(int)(g[u].size())-1].ede,g[u][(int)(g[u].size())-1].dis);
    }
    for(int i=1;i<=n;i++)dis[i]=2e9;
    dis[s]=0;
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>sq;
    sq.push(make_pair(s,0));
    while(!sq.empty()){
        v=sq.top().ede;
        w=sq.top().dis;
        sq.pop();
        if(vis[v])continue;
        vis[v]=true;
        for(int i=0;i<(int)(g[v].size());i++){
        	// printf("%d %d %d\n",v,g[v][i].ede,dis[g[v][i].ede]);
            if(dis[v]+g[v][i].dis<dis[g[v][i].ede]){
                dis[g[v][i].ede]=dis[v]+g[v][i].dis;
                sq.push(make_pair(g[v][i].ede,dis[g[v][i].ede]));
            }
        }
    }
    for(int i=1;i<=n;i++)printf("%d ",dis[i]);
    return 0;
}