dijkstra+堆 模板

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <cmath>
#define DU double
using namespace std;
const int MN=100005;
const int MM=400050;
const int INF=1000000000;
priority_queue <pair<int,int> > q;
int p[MN],d[MN],vis[MN],ec;
int n,m,sx,x,y,value;
struct cyq{
	int v,next,w;
}edge[MM];
void add(int u, int v,int ww){	 
	edge[++ec].v = v;
	edge[ec].w = ww;
	edge[ec].next = p[u];
	p[u] = ec;
}

void dijkstra(int root){
    for(int i=1;i<=n;i++) d[i]=INF;
    d[root]=0;
    q.push(make_pair(0,root));
    while(!q.empty()){
        int u=q.top().second;q.pop();
        if(vis[u]) continue;
        vis[u]=1;
        for(int i=p[u];i;i=edge[i].next){
           int v=edge[i].v,va=edge[i].w;
            if(d[v]>d[u]+va) d[v]=d[u]+va;
            q.push(make_pair(-d[v],v));
        }   
    }
}
int main(){
    scanf("%d%d%d",&n,&m,&sx);
    for(int i=1;i<=m;i++){
        scanf("%d%d%d",&x,&y,&value);
        add(x,y,value);
    }
    dijkstra(sx);
    for(int i=1;i<=n;i++)
        printf("%d ",d[i]);
    printf("\n");
}