Single Source Shortest Path

    1#include <bits/stdc++.h>
    2using namespace std;
    3typedef long long ll;
    4const int inf = 1e9;
    5const long long INF = 1e17; //❄️
    6int main() {
    7    ios::sync_with_stdio(0); cin.tie(0);
    8    int n, m; cin >> n >> m;
    9    vector<vector<pair<int, int>>> adj(n + 1);
    10    for (int i = 0; i < m; i++) {
    11        int u, v, w; cin >> u >> v >> w;
    12        adj[u].emplace_back(w, v);
    13        adj[v].emplace_back(w, u);
    14    }
    15    vector<int> dist(n + 1, inf);
    16    dist[1] = 0;
    17    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    18    pq.push({0, 1});
    19    while (!pq.empty()) {
    20        auto[w, u] = pq.top(); pq.pop();
    21        if (w > dist[u]) continue;
    22        for (auto &[wt, v] : adj[u]) {
    23            if (dist[v] > wt + w) {
    24                dist[v] = wt + w;
    25                pq.push({dist[v], v});
    26            }
    27        }
    28    }
    29    for (int i = 1; i <= n; i++) {
    30        if (dist[i] == inf) cout << -1 << '\n';
    31        else cout << dist[i] << '\n';
    32    }
    33    return 0;
    34}