Shortest Routes I

#include <bits/stdc++.h>
#include <climits>

#define ll long long
using namespace std;

int main() {
#ifdef LOCAL
  auto in = ifstream("input.txt");
  cin.rdbuf(in.rdbuf());
#endif

  int n, m;
  cin >> n >> m;

  vector<vector<pair<int, ll>>> adj(n + 1);

  for (int i = 0; i < m; i++) {
    int a, b;
    ll c;
    cin >> a >> b >> c;
    adj[a].push_back({
        b,
        c,
    });
  }

  auto distance = vector<ll>(n + 1, LONG_LONG_MAX);
  distance[1] = 0;

  priority_queue<pair<ll, int>> q;
  vector<bool> processed(n + 1);
  q.push({0, 1});

  while (!q.empty()) {
    int a = q.top().second;
    q.pop();
    if (processed[a])
      continue;
    processed[a] = true;
    for (auto u : adj[a]) {
      int b = u.first;
      ll w = u.second;
      if (distance[a] + w < distance[b]) {
        distance[b] = distance[a] + w;
        q.push({-distance[b], b});
      }
    }
  }

  for (int i = 1; i <= n; i++) {
    cout << distance[i] << " ";
  }
}

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