Shortest Routes I

#include <bits/stdc++.h>
using namespace std;

#define PRINT_ARR(arr, n)                                                      \
  do {                                                                         \
    for (int i = 0; i < n; i++) {                                              \
      cout << arr[i] << " ";                                                   \
    }                                                                          \
    cout << "\n";                                                              \
  } while (0)

typedef long long ll;
typedef pair<ll, ll> pp;

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

  int n, m;
  cin >> n >> m;
  bool visited[n + 1];
  memset(visited, 0, (n + 1) * sizeof(bool));

  vector<ll> dist(n + 1, LONG_LONG_MAX);
  dist[1] = 0;
  vector<pp> path[n + 1];

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

  priority_queue<pp> q;
  q.push(make_pair(0, 1));
  while (q.size() > 0) {
    auto p = q.top();
    q.pop();

    ll curr_dst = -p.first, city = p.second;
    if (visited[city] || dist[city] < curr_dst) {
        continue;
    }
    for (auto f : path[city]) {
      if (curr_dst + f.second < dist[f.first]) {
          dist[f.first] = curr_dst + f.second;
          q.push(make_pair(-dist[f.first], f.first));
          visited[f.first] = false;
      }
    }
    visited[city] = true;
  }
  
  for (int i = 1; i <= n; i++) {
      cout << dist[i] << " ";
  }
  cout << "\n";
  return 0;
}

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