Shortest Routes I

#include <iostream>
#include <queue>
#include <vector>
#define ll unsigned long long

int main() {
  ll cityCount, flightCount;
  std::cin >> cityCount;
  std::cin >> flightCount;

  std::vector<std::vector<std::pair<int, int>>> connMap(cityCount);
  for (ll ii = 0; ii < flightCount; ii++) {
    ll start, end, cost;
    std::cin >> start;
    std::cin >> end;
    std::cin >> cost;
    connMap[start - 1].push_back({end - 1, cost});
    // std::cout << 123 << std::endl;
    // connMap[end - 1].push_back({start - 1, cost});
  }
  std::priority_queue<std::pair<ll, ll>> qq;
  std::vector<ll> dists(cityCount, 1e15);
  std::vector<char> cheked(cityCount, 0);
  dists[0] = 0;
  qq.push({0, 0});

  while (!qq.empty()) {
    int city = qq.top().second;
    qq.pop();
    if (cheked[city])
      continue;
    cheked[city] = 1;
    for (std::pair<ll, ll> neighbour : connMap[city]) {
      if (dists[city] + neighbour.second < dists[neighbour.first]) {
        dists[neighbour.first] = dists[city] + neighbour.second;
        qq.push({-dists[neighbour.first], neighbour.first});
      }
    }
  }

  for (ll ii = 0; ii < cityCount - 1; ii++) {
    std::cout << dists[ii] << " ";
  }
  std::cout << dists[cityCount - 1] << std::endl;

  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