Ladders

input/code.cpp: In function 'int main()':
input/code.cpp:49:8: warning: unused variable 'prio' [-Wunused-variable]
   49 |     ll prio = pair.first;
      |        ^~~~

#include <iostream>
#include <queue>
#include <vector>

#define ll long long

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
  os << "[";
  for (int i = 0; i < v.size(); ++i) {
    os << v[i];
    if (i != v.size() - 1)
      os << ", ";
  }
  os << "]";
  return os;
}

int main() {
  ll numCuont;
  std::cin >> numCuont;

  std::vector<ll> inputNums(numCuont, 0);
  for (ll ii = 0; ii < numCuont; ii++) {
    ll start;
    std::cin >> start;
    inputNums[ii] = start - 1;
  }
  std::vector<std::vector<ll>> ladders(numCuont, std::vector<ll>());
  for (ll ii = 0; ii < numCuont; ii++) {
    ladders[ii].push_back(ii + 1);
    for (ll jj = ii + 2; jj < numCuont; jj++) {
      //   ladders[ii].push_back(inputNums[ii + 1]);
      if ((inputNums[jj] + 1) % (inputNums[ii] + 1) == 0) {
        ladders[ii].push_back(jj);
      }
    }
  }

  std::priority_queue<std::pair<ll, ll>> qq;
  std::vector<ll> dists(numCuont, 1e15);
  dists[0] = 0;

  std::vector<char> cheked(numCuont, 0);
  qq.push({0, 0});

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

  //   std::cout << inputNums << std::endl;
  //   std::cout << ladders << std::endl;
  std::cout << dists[dists.size() - 1] << std::endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: RUNTIME ERROR

Test 14

Verdict: RUNTIME ERROR

Test 15

Verdict: RUNTIME ERROR

Test 16

Verdict: RUNTIME ERROR

Test 17

Verdict: RUNTIME ERROR

Test 18

Verdict: RUNTIME ERROR

Test 19

Verdict: RUNTIME ERROR

Test 20

Verdict: RUNTIME ERROR

Test 21

Verdict: RUNTIME ERROR

Test 22

Verdict: RUNTIME ERROR

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: WRONG ANSWER

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: WRONG ANSWER

Test 53

Verdict: WRONG ANSWER

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: WRONG ANSWER

Test 62

Verdict: TIME LIMIT EXCEEDED

Test 63

Verdict: TIME LIMIT EXCEEDED

Test 64

Verdict: TIME LIMIT EXCEEDED

Test 65

Verdict: TIME LIMIT EXCEEDED

Test 66

Verdict: TIME LIMIT EXCEEDED

Test 67

Verdict: TIME LIMIT EXCEEDED

Test 68

Verdict: TIME LIMIT EXCEEDED

Test 69

Verdict: TIME LIMIT EXCEEDED

Test 70

Verdict: TIME LIMIT EXCEEDED

Test 71

Verdict: TIME LIMIT EXCEEDED