هاتکدز — زمین بازی برای برنامه‌نویس شدن

01#include <bits/stdc++.h>
02using namespace std;
03
04const long long INF = 1e18;
05
06void dijkstra(int start_node, int n, const vector<vector<pair<int, long long>>>& adj) {
07    vector<long long> dist(n + 1, INF);
08    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<>> pq;
09
10    dist[start_node] = 0;
11    pq.push({0, start_node});
12
13    while (!pq.empty()) {
14        auto [d, u] = pq.top(); pq.pop();
15        if (d > dist[u]) continue;
16
17        for (auto& [v, w] : adj[u]) {
18            if (dist[u] + w < dist[v]) {
19                dist[v] = dist[u] + w;
20                pq.push({dist[v], v});
21            }
22        }
23    }
24}