Shortest Routes I

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <climits>
#include <queue>

typedef long long ll;

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    // freopen("input.txt", "r", stdin); // TODO: REMOVE THIS YOU STUPID ****

    int n, m;
    cin >> n >> m;
    vector<vector<pair<int, int>>> adj(n, vector<pair<int, int>>());
    for (int i = 0; i < m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u-1].push_back({v-1, w});
    }
    vector<ll> distances(n, LLONG_MAX);
    vector<bool> processed(n, false);
    priority_queue<pair<ll, int>> q;

    int start = 0;
    distances[start] = 0;
    q.push({0, start});
    while (!q.empty()) {
        int node = q.top().second; q.pop();
        if (processed[node]) continue;
        processed[node] = true;
        for (auto& edge : adj[node]) {
            int v = edge.first;
            int w = edge.second;
            if (distances[node] + w < distances[v]) {
                distances[v] = distances[node] + w;
                q.push({-distances[v], v});
            }
        }
    }
    for (auto d : distances) {
        cout << d << " ";
    }

}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED