P3371 【模板】单源最短路径（弱化版）

#include<cstdio>
#include<cstring>
#include<queue>
#include<utility>
using namespace std;
const int maxn_v = 1e4 + 5;
const int maxn = 5e5 + 5;
int ver[maxn], edge[maxn], next[maxn], head[maxn_v], dis[maxn_v];
bool vis[maxn_v];
int tot, n, m, s;
priority_queue<pair<int,int> > q;
void Add(int x,int y,int z)
{
    ver[++tot] = y, edge[tot] = z, next[tot] = head[x], head[x] = tot;
}
void dijkstra()
{
    memset(dis,0x3f,sizeof(dis));
    memset(vis,0,sizeof(vis));
    dis[s] = 0;
    q.push(make_pair(0,s));
    while(q.size()){
        int x = q.top().second; q.pop();
        if(vis[x]) continue;
        vis[x] = 1;
        for(int i = head[x]; i; i = next[i]){
            int y = ver[i], z = edge[i];
            if(dis[y] > dis[x] + z){
                dis[y] = dis[x] + z;
                q.push(make_pair(-dis[y],y));
            }
        }
    }
}
int main()
{
    int u, v, w;;
    scanf("%d%d%d",&n,&m,&s);
    for(int i = 1; i <= m; i++){
        scanf("%d%d%d",&u,&v,&w);
        Add(u,v,w);
    }
    dijkstra();
    int tmp = 0x3f3f3f3f;
    for(int i = 1; i <= n; i++){
        if(dis[i] == tmp) printf("2147483647 ");
        else printf("%d ",dis[i]);
    }
    printf("\n");
    return 0;
}