CSES - Aalto Competitive Programming 2025 - wk6 - Wed

Submission details
Task:	Ladders
Sender:	aalto25f_006
Submission time:	2025-10-08 17:37:56 +0300
Language:	C++ (C++17)
Status:	READY
Result:	WRONG ANSWER

Test results
test	verdict	time
#1	ACCEPTED	0.00 s	details
#2	WRONG ANSWER	0.00 s	details
#3	WRONG ANSWER	0.00 s	details
#4	WRONG ANSWER	0.00 s	details
#5	RUNTIME ERROR	0.00 s	details
#6	RUNTIME ERROR	0.00 s	details
#7	RUNTIME ERROR	0.00 s	details
#8	WRONG ANSWER	0.00 s	details
#9	WRONG ANSWER	0.00 s	details
#10	WRONG ANSWER	0.00 s	details
#11	WRONG ANSWER	0.00 s	details
#12	WRONG ANSWER	0.00 s	details
#13	RUNTIME ERROR	0.00 s	details
#14	RUNTIME ERROR	0.00 s	details
#15	RUNTIME ERROR	0.00 s	details
#16	RUNTIME ERROR	0.00 s	details
#17	RUNTIME ERROR	0.00 s	details
#18	RUNTIME ERROR	0.00 s	details
#19	RUNTIME ERROR	0.00 s	details
#20	RUNTIME ERROR	0.00 s	details
#21	RUNTIME ERROR	0.00 s	details
#22	RUNTIME ERROR	0.00 s	details
#23	WRONG ANSWER	0.00 s	details
#24	WRONG ANSWER	0.00 s	details
#25	WRONG ANSWER	0.00 s	details
#26	WRONG ANSWER	0.00 s	details
#27	WRONG ANSWER	0.00 s	details
#28	WRONG ANSWER	0.00 s	details
#29	WRONG ANSWER	0.00 s	details
#30	WRONG ANSWER	0.00 s	details
#31	WRONG ANSWER	0.00 s	details
#32	WRONG ANSWER	0.00 s	details
#33	WRONG ANSWER	0.00 s	details
#34	WRONG ANSWER	0.00 s	details
#35	WRONG ANSWER	0.00 s	details
#36	WRONG ANSWER	0.00 s	details
#37	WRONG ANSWER	0.00 s	details
#38	WRONG ANSWER	0.00 s	details
#39	WRONG ANSWER	0.00 s	details
#40	WRONG ANSWER	0.00 s	details
#41	WRONG ANSWER	0.00 s	details
#42	WRONG ANSWER	0.00 s	details
#43	WRONG ANSWER	0.00 s	details
#44	WRONG ANSWER	0.00 s	details
#45	WRONG ANSWER	0.00 s	details
#46	WRONG ANSWER	0.00 s	details
#47	WRONG ANSWER	0.00 s	details
#48	WRONG ANSWER	0.00 s	details
#49	WRONG ANSWER	0.00 s	details
#50	WRONG ANSWER	0.00 s	details
#51	WRONG ANSWER	0.00 s	details
#52	WRONG ANSWER	0.01 s	details
#53	WRONG ANSWER	0.01 s	details
#54	WRONG ANSWER	0.01 s	details
#55	WRONG ANSWER	0.01 s	details
#56	WRONG ANSWER	0.01 s	details
#57	WRONG ANSWER	0.01 s	details
#58	WRONG ANSWER	0.01 s	details
#59	WRONG ANSWER	0.01 s	details
#60	WRONG ANSWER	0.01 s	details
#61	WRONG ANSWER	0.01 s	details
#62	TIME LIMIT EXCEEDED	--	details
#63	TIME LIMIT EXCEEDED	--	details
#64	TIME LIMIT EXCEEDED	--	details
#65	TIME LIMIT EXCEEDED	--	details
#66	TIME LIMIT EXCEEDED	--	details
#67	TIME LIMIT EXCEEDED	--	details
#68	TIME LIMIT EXCEEDED	--	details
#69	TIME LIMIT EXCEEDED	--	details
#70	TIME LIMIT EXCEEDED	--	details
#71	TIME LIMIT EXCEEDED	--	details

Compiler report

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

Code

#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[0] << std::endl;
}

Test details

Test 1

Verdict: ACCEPTED

input
`1 1` view save

correct output
`0` view save

user output
`0` view save

Test 2

Verdict: WRONG ANSWER

input
`2 2 1` view save

correct output
`1` view save

user output
`0` view save

Test 3

Verdict: WRONG ANSWER

input
`2 1 2` view save

correct output
`1` view save

user output
`0` view save

Test 4

Verdict: WRONG ANSWER

input
`2 2 1` view save

correct output
`1` view save

user output
`0` view save

Test 5

Verdict: RUNTIME ERROR

input
`3 2 3 1` view save

correct output
`2` view save

user output
(empty)

Test 6

Verdict: RUNTIME ERROR

input
`3 1 2 3` view save

correct output
`1` view save

user output
(empty)

Test 7

Verdict: RUNTIME ERROR

input
`3 3 2 1` view save

correct output
`2` view save

user output
(empty)

Test 8

Verdict: WRONG ANSWER

input
`4 3 2 1 4` view save

correct output
`2` view save

user output
`0` view save

Test 9

Verdict: WRONG ANSWER

input
`4 4 3 2 1` view save

correct output
`3` view save

user output
`0` view save

Test 10

Verdict: WRONG ANSWER

input
`4 4 2 1 3` view save

correct output
`3` view save

user output
`0` view save

Test 11

Verdict: WRONG ANSWER

input
`4 3 2 1 4` view save

correct output
`2` view save

user output
`0` view save

Test 12

Verdict: WRONG ANSWER

input
`4 1 3 2 4` view save

correct output
`1` view save

user output
`0` view save

Test 13

Verdict: RUNTIME ERROR

input
`5 3 2 4 1 5` view save

correct output
`4` view save

user output
(empty)

Test 14

Verdict: RUNTIME ERROR

input
`5 1 2 4 3 5` view save

correct output
`1` view save

user output
(empty)

Test 15

Verdict: RUNTIME ERROR

input
`5 5 3 1 2 4` view save

correct output
`3` view save

user output
(empty)

Test 16

Verdict: RUNTIME ERROR

input
`5 3 1 4 2 5` view save

correct output
`2` view save

user output
(empty)

Test 17

Verdict: RUNTIME ERROR

input
`5 1 2 3 4 5` view save

correct output
`1` view save

user output
(empty)

Test 18

Verdict: RUNTIME ERROR

input
`5 3 1 5 4 2` view save

correct output
`2` view save

user output
(empty)

Test 19

Verdict: RUNTIME ERROR

input
`5 5 4 3 2 1` view save

correct output
`4` view save

user output
(empty)

Test 20

Verdict: RUNTIME ERROR

input
`5 5 3 1 4 2` view save

correct output
`3` view save

user output
(empty)

Test 21

Verdict: RUNTIME ERROR

input
`5 5 4 3 2 1` view save

correct output
`4` view save

user output
(empty)

Test 22

Verdict: RUNTIME ERROR

input
`5 5 1 4 3 2` view save

correct output
`2` view save

user output
(empty)

Test 23

Verdict: WRONG ANSWER

input
`10 4 8 3 1 7 2 5 10 6 9` view save

correct output
`3` view save

user output
`0` view save

Test 24

Verdict: WRONG ANSWER

input
`10 8 10 3 6 5 1 4 7 2 9` view save

correct output
`3` view save

user output
`0` view save

Test 25

Verdict: WRONG ANSWER

input
`10 4 1 2 7 5 10 8 6 9 3` view save

correct output
`2` view save

user output
`0` view save

Test 26

Verdict: WRONG ANSWER

input
`10 10 9 7 2 5 1 3 4 6 8` view save

correct output
`4` view save

user output
`0` view save

Test 27

Verdict: WRONG ANSWER

input
`10 1 2 3 4 5 6 7 8 9 10` view save

correct output
`1` view save

user output
`0` view save

Test 28

Verdict: WRONG ANSWER

input
`10 6 7 10 9 5 2 1 3 8 4` view save

correct output
`6` view save

user output
`0` view save

Test 29

Verdict: WRONG ANSWER

input
`10 10 9 8 7 6 5 4 3 2 1` view save

correct output
`9` view save

user output
`0` view save

Test 30

Verdict: WRONG ANSWER

input
`10 8 5 3 7 4 1 6 2 10 9` view save

correct output
`3` view save

user output
`0` view save

Test 31

Verdict: WRONG ANSWER

input
`10 10 9 8 7 6 5 4 3 2 1` view save

correct output
`9` view save

user output
`0` view save

Test 32

Verdict: WRONG ANSWER

input
`10 10 3 6 8 4 5 1 7 2 9` view save

correct output
`2` view save

user output
`0` view save

Test 33

Verdict: WRONG ANSWER

input
`100 14 63 92 70 7 59 86 25 60 9 73...` view save

correct output
`4` view save

user output
`0` view save

Test 34

Verdict: WRONG ANSWER

input
`100 92 55 15 16 23 1 24 22 89 71 6...` view save

correct output
`6` view save

user output
`0` view save

Test 35

Verdict: WRONG ANSWER

input
`100 34 58 2 29 82 83 47 100 91 35 ...` view save

correct output
`3` view save

user output
`0` view save

Test 36

Verdict: WRONG ANSWER

input
`100 26 63 34 33 58 41 40 29 22 8 7...` view save

correct output
`5` view save

user output
`0` view save

Test 37

Verdict: WRONG ANSWER

input
`100 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`1` view save

user output
`0` view save

Test 38

Verdict: WRONG ANSWER

input
`100 6 85 10 52 5 84 64 92 89 31 60...` view save

correct output
`1` view save

user output
`0` view save

Test 39

Verdict: WRONG ANSWER

input
`100 100 99 98 97 96 95 94 93 92 91...` view save

correct output
`99` view save

user output
`0` view save

Test 40

Verdict: WRONG ANSWER

input
`100 33 75 25 88 30 21 6 11 72 70 3...` view save

correct output
`5` view save

user output
`0` view save

Test 41

Verdict: WRONG ANSWER

input
`100 30 86 34 36 29 12 39 7 65 23 3...` view save

correct output
`8` view save

user output
`0` view save

Test 42

Verdict: WRONG ANSWER

input
`200 14 63 135 70 7 59 198 180 108 ...` view save

correct output
`6` view save

user output
`0` view save

Test 43

Verdict: WRONG ANSWER

input
`200 92 55 151 199 107 153 113 22 1...` view save

correct output
`5` view save

user output
`0` view save

Test 44

Verdict: WRONG ANSWER

input
`200 34 58 2 29 82 162 47 100 91 35...` view save

correct output
`5` view save

user output
`0` view save

Test 45

Verdict: WRONG ANSWER

input
`200 148 63 188 153 170 41 180 112 ...` view save

correct output
`9` view save

user output
`0` view save

Test 46

Verdict: WRONG ANSWER

input
`200 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`1` view save

user output
`0` view save

Test 47

Verdict: WRONG ANSWER

input
`200 175 162 119 135 5 84 180 92 89...` view save

correct output
`8` view save

user output
`0` view save

Test 48

Verdict: WRONG ANSWER

input
`200 200 199 198 197 196 195 194 19...` view save

correct output
`199` view save

user output
`0` view save

Test 49

Verdict: WRONG ANSWER

input
`200 160 75 25 88 30 21 6 11 72 70 ...` view save

correct output
`5` view save

user output
`0` view save

Test 50

Verdict: WRONG ANSWER

input
`200 30 86 162 36 29 12 145 195 134...` view save

correct output
`4` view save

user output
`0` view save

Test 51

Verdict: WRONG ANSWER

input
`200 47 121 66 36 23 37 113 151 60 ...` view save

correct output
`6` view save

user output
`0` view save

Test 52

Verdict: WRONG ANSWER

input
`1000 934 460 976 361 744 297 198 66...` view save

correct output
`12` view save

user output
`0` view save

Test 53

Verdict: WRONG ANSWER

input
`1000 999 410 151 405 349 770 809 59...` view save

correct output
`12` view save

user output
`0` view save

Test 54

Verdict: WRONG ANSWER

input
`1000 505 953 714 811 82 503 751 709...` view save

correct output
`9` view save

user output
`0` view save

Test 55

Verdict: WRONG ANSWER

input
`1000 960 63 254 153 973 296 180 300...` view save

correct output
`6` view save

user output
`0` view save

Test 56

Verdict: WRONG ANSWER

input
`1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`1` view save

user output
`0` view save

Test 57

Verdict: WRONG ANSWER

input
`1000 919 660 119 418 355 220 207 38...` view save

correct output
`8` view save

user output
`0` view save

Test 58

Verdict: WRONG ANSWER

input
`1000 1000 999 998 997 996 995 994 9...` view save

correct output
`999` view save

user output
`0` view save

Test 59

Verdict: WRONG ANSWER

input
`1000 219 802 25 833 912 846 639 806...` view save

correct output
`5` view save

user output
`0` view save

Test 60

Verdict: WRONG ANSWER

input
`1000 821 625 397 588 943 372 469 30...` view save

correct output
`15` view save

user output
`0` view save

Test 61

Verdict: WRONG ANSWER

input
`1000 749 481 66 36 256 37 113 712 5...` view save

correct output
`10` view save

user output
`0` view save

Test 62

Verdict: TIME LIMIT EXCEEDED

input
`100000 26990 68204 21904 3028 29287 1...` view save

correct output
`8` view save

user output
(empty)

Test 63

Verdict: TIME LIMIT EXCEEDED

input
`100000 94616 96638 65840 9893 92126 1...` view save

correct output
`12` view save

user output
(empty)

Test 64

Verdict: TIME LIMIT EXCEEDED

input
`100000 11080 90273 56653 73314 33646 ...` view save

correct output
`10` view save

user output
(empty)

Test 65

Verdict: TIME LIMIT EXCEEDED

input
`100000 27548 48776 71938 59265 12094 ...` view save

correct output
`11` view save

user output
(empty)

Test 66

Verdict: TIME LIMIT EXCEEDED

input
`100000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`1` view save

user output
(empty)

Test 67

Verdict: TIME LIMIT EXCEEDED

input
`100000 77221 89614 36710 27644 37101 ...` view save

correct output
`11` view save

user output
(empty)

Test 68

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 99999 99998 99997 99996...` view save

correct output
`99999` view save

user output
(empty)

Test 69

Verdict: TIME LIMIT EXCEEDED

input
`100000 68737 37819 55518 77756 46481 ...` view save

correct output
`12` view save

user output
(empty)

Test 70

Verdict: TIME LIMIT EXCEEDED

input
`100000 39437 53659 60243 20923 38668 ...` view save

correct output
`11` view save

user output
(empty)

Test 71

Verdict: TIME LIMIT EXCEEDED

input
`100000 69631 70212 62831 61461 93551 ...` view save

correct output
`14` view save

user output
(empty)

Aalto Competitive Programming 2025 - wk6 - Wed

Ladders

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Test 52

Test 53

Test 54

Test 55

Test 56

Test 57

Test 58

Test 59

Test 60

Test 61

Test 62

Test 63

Test 64

Test 65

Test 66

Test 67

Test 68

Test 69

Test 70

Test 71

Tasks

Submissions (aalto25f_006)