[题]单源最短路径 —— YbtOJ-高效进阶2021-「图论」第3章 最短路径-【例题1】

单源最短路径

四年OI一场空，不开long long见祖宗……
再简单也不要掉以轻心！

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair <ll, int > P;
const int N = 1e5 + 10, M = 2e5 + 10;
int  n, m, s;
ll dist[N];
bool st[N];
int ne[M], h[N], e[M], idx = 0;
ll w[M];
void add(int a, int b, ll c){
    e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx ++;
}
void djs(int x){
    memset(dist , 0x3f, sizeof dist);
    priority_queue < P, vector<P>, greater<P> > q;
    dist[x] = 0;
    q.push({0, x});
    while(q.size()){
        P t = q.top();
        q.pop();
        int ver = t.second;
		ll dis = t.first;
        if(st[ver]) continue;
        st[ver] = 1;
        for(int i = h[ver]; i != -1; i = ne[i]){
            int j = e[i];
            if(dist[j] > dis + w[i]){
                dist[j] = dis + w[i];
                q.push({dist[j], j});
            }
        }
    }
}

int main(){
    scanf("%d%d%d", &n, &m, &s);
    memset(h, -1, sizeof h);
    for(int i = 1; i <= m; i ++){
        int a, b;
		ll c;
        scanf("%d%d%lld", &a, &b, &c);
        add(a, b, c);
    }
    djs(s);
    for(int i = 1; i <= n; i ++) printf("%lld ", dist[i]);
    return 0;
}

/*
4 6 1
1 2 2
2 3 2
2 4 1
1 3 5
3 4 3
1 4 4
*/