oj.uz

Submission #541633

# Submission time Handle Problem Language Result Execution time Memory
541633 2022-03-23T23:02:47 Z aryan12 Rainforest Jumps (APIO21_jumps) C++17
56 / 100
 4000 ms 45812 KB 
#include "jumps.h"
#include <vector>
using namespace std;
#include <bits/stdc++.h>

const int MAXN = 2e5 + 5;
int DP_Min[19][MAXN], DP_Max[19][MAXN];
vector<int> INPUT;
vector<int> g[MAXN];
bool ok = true;

void init(int N, vector<int> H) {
  vector<int> L(N), R(N);
  stack<int> q;
  for(int i = 0; i < N; i++) {
    if(H[i + 1] != i + 1) {
      ok = false;
    }
    INPUT.push_back(H[i]);
    while(!q.empty() && H[q.top()] <= H[i]) {
      q.pop();
    }
    if(q.empty()) {
      L[i] = -1;
    }
    else {
      L[i] = q.top();
    }
    q.push(i);
  }
  if(ok) return;
  while(!q.empty()) {
    q.pop();
  }
  for(int i = N - 1; i >= 0; i--) {
    while(!q.empty() && H[q.top()] <= H[i]) {
      q.pop();
    }
    if(q.empty()) {
      R[i] = N;
    }
    else {
      R[i] = q.top();
    }
    q.push(i);
  }
  for(int i = 0; i < N; i++) {
    if(L[i] == -1 && R[i] == N) {
      DP_Min[0][i] = -1;
      DP_Max[0][i] = -1;
    }
    else if(L[i] == -1 || R[i] == N) {
      if(L[i] == -1) {
        DP_Min[0][i] = R[i];
        DP_Max[0][i] = R[i];
      }
      else {
        DP_Min[0][i] = L[i];
        DP_Max[0][i] = L[i];
      }
    }
    else {
      if(H[L[i]] < H[R[i]]) {
        DP_Min[0][i] = L[i];
        DP_Max[0][i] = R[i];
      }
      else {
        DP_Min[0][i] = R[i];
        DP_Max[0][i] = L[i];
      }
      //DP_Min[0][i] = min(L[i], R[i]);
      //DP_Max[0][i] = max(L[i], R[i]);
    }
  }
  for(int i = 1; i < 19; i++) {
    for(int j = 0; j < N; j++) {
      if(DP_Min[i - 1][j] == -1) {
        DP_Min[i][j] = -1;
      }
      else {
        DP_Min[i][j] = DP_Min[i - 1][DP_Min[i - 1][j]];
      }
      if(DP_Max[i - 1][j] == -1) {
        DP_Max[i][j] = -1;
      }
      else {
        DP_Max[i][j] = DP_Max[i - 1][DP_Max[i - 1][j]];
      }
    }
  }
  //cout << "L[i] and R[i]\n";
  //for(int i = 0; i < N; i++) {
  //  cout << L[i] << " " << R[i] << "\n";
  //}
  //cout << DP_Min[0][4] << " " << DP_Max[0][4] << "\n";
  for(int i = 0; i < N; i++) {
    if(L[i] != -1) {
      g[i].push_back(L[i]);
    }
    if(R[i] != -1) {
      g[i].push_back(R[i]);
    }
  }
}

int minimum_jumps(int A, int B, int C, int D) {
  if(ok) {
    return C - B;
  }
  if(A != B || C != D) {
    queue<int> q;
    vector<int> dist(MAXN, 1e9);
    for(int i = A; i <= B; i++) {
      q.push(i);
      dist[i] = 0;
    }
    while(!q.empty()) {
      int node = q.front();
      q.pop();
      for(int i = 0; i < g[node].size(); i++) {
        if(dist[g[node][i]] == 1e9) {
          dist[g[node][i]] = dist[node] + 1;
          q.push(g[node][i]);
        }
      }
    }
    int ans = 1e9;
    for(int i = C; i <= D; i++) {
      ans = min(ans, dist[i]);
    }
    if(ans == 1e9) {
      return -1;
    }
    return ans;
  }
  int ans = 0, cur = B;
  for(int i = 18; i >= 0; i--) {
    if(DP_Max[i][cur] != -1 && INPUT[DP_Max[i][cur]] <= INPUT[C]) {
      //cout << "prev cur = " << cur << "\n";
      ans += (1 << i);
      cur = DP_Max[i][cur];
      //cout << "new cur = " << cur << ", with added answer: " << (1 << i) << "\n";
    }
  }
  for(int i = 18; i >= 0; i--) {
    if(DP_Min[i][cur] != -1 && INPUT[DP_Min[i][cur]] <= INPUT[C]) {
      ans += (1 << i);
      cur = DP_Min[i][cur];
    }
  }
  if(cur != C) return -1;
  return ans;
}

Compilation message

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:120:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |       for(int i = 0; i < g[node].size(); i++) {
      |                      ~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5200 KB Output is correct
2 Correct 2 ms 5072 KB Output is correct
3 Execution timed out 4064 ms 37616 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5968 KB Output is correct
2 Correct 2 ms 5200 KB Output is correct
3 Correct 3 ms 5200 KB Output is correct
4 Correct 2 ms 5200 KB Output is correct
5 Correct 14 ms 5968 KB Output is correct
6 Correct 20 ms 5968 KB Output is correct
7 Correct 21 ms 5968 KB Output is correct
8 Correct 18 ms 5968 KB Output is correct
9 Correct 8 ms 5968 KB Output is correct
10 Correct 31 ms 5968 KB Output is correct
11 Correct 28 ms 5968 KB Output is correct
12 Correct 21 ms 5968 KB Output is correct
13 Correct 30 ms 5968 KB Output is correct
14 Correct 19 ms 6016 KB Output is correct
15 Correct 21 ms 5968 KB Output is correct
16 Correct 31 ms 5968 KB Output is correct
17 Correct 20 ms 5968 KB Output is correct
18 Correct 3 ms 5200 KB Output is correct
19 Correct 6 ms 5968 KB Output is correct
20 Correct 20 ms 5976 KB Output is correct
21 Correct 19 ms 6020 KB Output is correct
22 Correct 29 ms 5968 KB Output is correct
23 Correct 19 ms 5968 KB Output is correct
24 Correct 22 ms 5968 KB Output is correct
25 Correct 3 ms 5192 KB Output is correct
26 Correct 2 ms 5200 KB Output is correct
27 Correct 4 ms 5200 KB Output is correct
28 Correct 4 ms 5200 KB Output is correct
29 Correct 5 ms 5200 KB Output is correct
30 Correct 5 ms 5200 KB Output is correct
31 Correct 4 ms 5200 KB Output is correct
32 Correct 5 ms 5200 KB Output is correct
33 Correct 3 ms 5200 KB Output is correct
34 Correct 3 ms 5200 KB Output is correct
35 Correct 4 ms 5968 KB Output is correct
36 Correct 5 ms 5968 KB Output is correct
37 Correct 4 ms 5968 KB Output is correct
38 Correct 4 ms 5968 KB Output is correct
39 Correct 4 ms 5968 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5968 KB Output is correct
2 Correct 2 ms 5200 KB Output is correct
3 Correct 3 ms 5200 KB Output is correct
4 Correct 2 ms 5200 KB Output is correct
5 Correct 14 ms 5968 KB Output is correct
6 Correct 20 ms 5968 KB Output is correct
7 Correct 21 ms 5968 KB Output is correct
8 Correct 18 ms 5968 KB Output is correct
9 Correct 8 ms 5968 KB Output is correct
10 Correct 31 ms 5968 KB Output is correct
11 Correct 28 ms 5968 KB Output is correct
12 Correct 21 ms 5968 KB Output is correct
13 Correct 30 ms 5968 KB Output is correct
14 Correct 19 ms 6016 KB Output is correct
15 Correct 21 ms 5968 KB Output is correct
16 Correct 31 ms 5968 KB Output is correct
17 Correct 20 ms 5968 KB Output is correct
18 Correct 3 ms 5200 KB Output is correct
19 Correct 6 ms 5968 KB Output is correct
20 Correct 20 ms 5976 KB Output is correct
21 Correct 19 ms 6020 KB Output is correct
22 Correct 29 ms 5968 KB Output is correct
23 Correct 19 ms 5968 KB Output is correct
24 Correct 22 ms 5968 KB Output is correct
25 Correct 3 ms 5192 KB Output is correct
26 Correct 2 ms 5200 KB Output is correct
27 Correct 4 ms 5200 KB Output is correct
28 Correct 4 ms 5200 KB Output is correct
29 Correct 5 ms 5200 KB Output is correct
30 Correct 5 ms 5200 KB Output is correct
31 Correct 4 ms 5200 KB Output is correct
32 Correct 5 ms 5200 KB Output is correct
33 Correct 3 ms 5200 KB Output is correct
34 Correct 3 ms 5200 KB Output is correct
35 Correct 4 ms 5968 KB Output is correct
36 Correct 5 ms 5968 KB Output is correct
37 Correct 4 ms 5968 KB Output is correct
38 Correct 4 ms 5968 KB Output is correct
39 Correct 4 ms 5968 KB Output is correct
40 Correct 3 ms 5968 KB Output is correct
41 Correct 2 ms 5200 KB Output is correct
42 Correct 2 ms 5200 KB Output is correct
43 Correct 2 ms 5200 KB Output is correct
44 Correct 15 ms 5968 KB Output is correct
45 Correct 30 ms 5968 KB Output is correct
46 Correct 14 ms 6012 KB Output is correct
47 Correct 28 ms 6036 KB Output is correct
48 Correct 7 ms 5968 KB Output is correct
49 Correct 32 ms 5968 KB Output is correct
50 Correct 20 ms 5968 KB Output is correct
51 Correct 30 ms 5968 KB Output is correct
52 Correct 19 ms 5968 KB Output is correct
53 Correct 20 ms 5968 KB Output is correct
54 Correct 20 ms 5968 KB Output is correct
55 Correct 19 ms 5968 KB Output is correct
56 Correct 31 ms 5968 KB Output is correct
57 Correct 3 ms 5200 KB Output is correct
58 Correct 138 ms 6324 KB Output is correct
59 Correct 209 ms 6464 KB Output is correct
60 Correct 49 ms 6096 KB Output is correct
61 Correct 171 ms 6372 KB Output is correct
62 Correct 145 ms 5968 KB Output is correct
63 Correct 177 ms 6372 KB Output is correct
64 Correct 178 ms 6352 KB Output is correct
65 Correct 201 ms 6352 KB Output is correct
66 Correct 201 ms 6352 KB Output is correct
67 Correct 201 ms 6352 KB Output is correct
68 Correct 218 ms 6352 KB Output is correct
69 Correct 188 ms 6352 KB Output is correct
70 Correct 192 ms 6352 KB Output is correct
71 Correct 3 ms 5200 KB Output is correct
72 Correct 5 ms 5968 KB Output is correct
73 Correct 29 ms 5968 KB Output is correct
74 Correct 20 ms 6096 KB Output is correct
75 Correct 19 ms 5968 KB Output is correct
76 Correct 22 ms 5968 KB Output is correct
77 Correct 30 ms 5968 KB Output is correct
78 Correct 3 ms 5200 KB Output is correct
79 Correct 3 ms 5200 KB Output is correct
80 Correct 4 ms 5200 KB Output is correct
81 Correct 4 ms 5200 KB Output is correct
82 Correct 5 ms 5200 KB Output is correct
83 Correct 4 ms 5200 KB Output is correct
84 Correct 4 ms 5200 KB Output is correct
85 Correct 4 ms 5200 KB Output is correct
86 Correct 3 ms 5200 KB Output is correct
87 Correct 3 ms 5200 KB Output is correct
88 Correct 3 ms 5968 KB Output is correct
89 Correct 4 ms 5968 KB Output is correct
90 Correct 3 ms 5968 KB Output is correct
91 Correct 4 ms 5968 KB Output is correct
92 Correct 4 ms 5968 KB Output is correct
93 Correct 3 ms 5200 KB Output is correct
94 Correct 31 ms 6012 KB Output is correct
95 Correct 178 ms 6352 KB Output is correct
96 Correct 187 ms 6352 KB Output is correct
97 Correct 173 ms 6352 KB Output is correct
98 Correct 206 ms 6352 KB Output is correct
99 Correct 184 ms 6352 KB Output is correct
100 Correct 3 ms 5164 KB Output is correct
101 Correct 3 ms 5328 KB Output is correct
102 Correct 19 ms 5584 KB Output is correct
103 Correct 20 ms 5584 KB Output is correct
104 Correct 17 ms 5584 KB Output is correct
105 Correct 11 ms 5560 KB Output is correct
106 Correct 17 ms 5584 KB Output is correct
107 Correct 3 ms 5200 KB Output is correct
108 Correct 4 ms 6096 KB Output is correct
109 Correct 6 ms 6376 KB Output is correct
110 Correct 4 ms 6372 KB Output is correct
111 Correct 4 ms 6352 KB Output is correct
112 Correct 4 ms 6380 KB Output is correct
113 Correct 5 ms 6352 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5968 KB Output is correct
2 Correct 4 ms 5200 KB Output is correct
3 Correct 2 ms 5200 KB Output is correct
4 Correct 3 ms 5200 KB Output is correct
5 Correct 50 ms 37200 KB Output is correct
6 Correct 65 ms 44912 KB Output is correct
7 Correct 32 ms 25628 KB Output is correct
8 Correct 81 ms 44808 KB Output is correct
9 Correct 13 ms 11980 KB Output is correct
10 Correct 66 ms 44912 KB Output is correct
11 Correct 59 ms 45812 KB Output is correct
12 Correct 60 ms 45168 KB Output is correct
13 Correct 73 ms 45552 KB Output is correct
14 Correct 64 ms 44840 KB Output is correct
15 Correct 61 ms 44916 KB Output is correct
16 Correct 62 ms 44984 KB Output is correct
17 Correct 64 ms 44860 KB Output is correct
18 Correct 3 ms 5200 KB Output is correct
19 Correct 3 ms 5200 KB Output is correct
20 Correct 4 ms 5968 KB Output is correct
21 Correct 3 ms 5968 KB Output is correct
22 Correct 4 ms 5968 KB Output is correct
23 Correct 4 ms 5968 KB Output is correct
24 Correct 4 ms 5968 KB Output is correct
25 Correct 3 ms 5212 KB Output is correct
26 Correct 4 ms 6096 KB Output is correct
27 Correct 4 ms 6376 KB Output is correct
28 Correct 4 ms 6352 KB Output is correct
29 Correct 4 ms 6352 KB Output is correct
30 Correct 5 ms 6352 KB Output is correct
31 Correct 5 ms 6392 KB Output is correct
32 Correct 2 ms 5200 KB Output is correct
33 Correct 60 ms 44928 KB Output is correct
34 Correct 63 ms 44868 KB Output is correct
35 Correct 53 ms 45504 KB Output is correct
36 Correct 60 ms 44912 KB Output is correct
37 Correct 58 ms 44916 KB Output is correct
38 Correct 63 ms 44940 KB Output is correct
39 Correct 3 ms 5200 KB Output is correct
40 Correct 40 ms 28228 KB Output is correct
41 Correct 64 ms 44916 KB Output is correct
42 Correct 48 ms 45552 KB Output is correct
43 Correct 60 ms 44860 KB Output is correct
44 Correct 58 ms 44932 KB Output is correct
45 Correct 70 ms 44860 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5200 KB Output is correct
2 Correct 3 ms 5200 KB Output is correct
3 Correct 3 ms 5200 KB Output is correct
4 Correct 187 ms 23396 KB Output is correct
5 Correct 877 ms 44860 KB Output is correct
6 Correct 613 ms 11724 KB Output is correct
7 Correct 892 ms 44916 KB Output is correct
8 Correct 514 ms 18824 KB Output is correct
9 Correct 904 ms 44860 KB Output is correct
10 Correct 879 ms 45752 KB Output is correct
11 Correct 830 ms 44976 KB Output is correct
12 Correct 785 ms 45576 KB Output is correct
13 Correct 876 ms 44800 KB Output is correct
14 Correct 894 ms 44860 KB Output is correct
15 Correct 796 ms 44944 KB Output is correct
16 Correct 762 ms 44856 KB Output is correct
17 Correct 2 ms 5200 KB Output is correct
18 Correct 3 ms 5200 KB Output is correct
19 Correct 5 ms 5200 KB Output is correct
20 Correct 5 ms 5200 KB Output is correct
21 Correct 5 ms 5240 KB Output is correct
22 Correct 5 ms 5200 KB Output is correct
23 Correct 4 ms 5200 KB Output is correct
24 Correct 4 ms 5200 KB Output is correct
25 Correct 3 ms 5200 KB Output is correct
26 Correct 3 ms 5328 KB Output is correct
27 Correct 22 ms 5584 KB Output is correct
28 Correct 20 ms 5584 KB Output is correct
29 Correct 19 ms 5584 KB Output is correct
30 Correct 20 ms 5584 KB Output is correct
31 Correct 19 ms 5584 KB Output is correct
32 Correct 2 ms 5200 KB Output is correct
33 Correct 36 ms 28224 KB Output is correct
34 Correct 70 ms 44808 KB Output is correct
35 Correct 64 ms 45556 KB Output is correct
36 Correct 60 ms 44908 KB Output is correct
37 Correct 53 ms 44912 KB Output is correct
38 Correct 71 ms 44904 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5200 KB Output is correct
2 Correct 3 ms 5200 KB Output is correct
3 Correct 3 ms 5200 KB Output is correct
4 Correct 187 ms 23396 KB Output is correct
5 Correct 877 ms 44860 KB Output is correct
6 Correct 613 ms 11724 KB Output is correct
7 Correct 892 ms 44916 KB Output is correct
8 Correct 514 ms 18824 KB Output is correct
9 Correct 904 ms 44860 KB Output is correct
10 Correct 879 ms 45752 KB Output is correct
11 Correct 830 ms 44976 KB Output is correct
12 Correct 785 ms 45576 KB Output is correct
13 Correct 876 ms 44800 KB Output is correct
14 Correct 894 ms 44860 KB Output is correct
15 Correct 796 ms 44944 KB Output is correct
16 Correct 762 ms 44856 KB Output is correct
17 Correct 2 ms 5200 KB Output is correct
18 Correct 3 ms 5200 KB Output is correct
19 Correct 5 ms 5200 KB Output is correct
20 Correct 5 ms 5200 KB Output is correct
21 Correct 5 ms 5240 KB Output is correct
22 Correct 5 ms 5200 KB Output is correct
23 Correct 4 ms 5200 KB Output is correct
24 Correct 4 ms 5200 KB Output is correct
25 Correct 3 ms 5200 KB Output is correct
26 Correct 3 ms 5328 KB Output is correct
27 Correct 22 ms 5584 KB Output is correct
28 Correct 20 ms 5584 KB Output is correct
29 Correct 19 ms 5584 KB Output is correct
30 Correct 20 ms 5584 KB Output is correct
31 Correct 19 ms 5584 KB Output is correct
32 Correct 2 ms 5200 KB Output is correct
33 Correct 36 ms 28224 KB Output is correct
34 Correct 70 ms 44808 KB Output is correct
35 Correct 64 ms 45556 KB Output is correct
36 Correct 60 ms 44908 KB Output is correct
37 Correct 53 ms 44912 KB Output is correct
38 Correct 71 ms 44904 KB Output is correct
39 Correct 3 ms 5200 KB Output is correct
40 Correct 3 ms 5200 KB Output is correct
41 Correct 3 ms 5200 KB Output is correct
42 Correct 233 ms 23360 KB Output is correct
43 Correct 654 ms 44900 KB Output is correct
44 Correct 476 ms 11724 KB Output is correct
45 Correct 803 ms 44816 KB Output is correct
46 Correct 468 ms 18880 KB Output is correct
47 Correct 833 ms 44920 KB Output is correct
48 Correct 943 ms 45628 KB Output is correct
49 Correct 947 ms 45044 KB Output is correct
50 Correct 689 ms 45592 KB Output is correct
51 Correct 784 ms 44804 KB Output is correct
52 Correct 839 ms 44860 KB Output is correct
53 Correct 809 ms 44916 KB Output is correct
54 Correct 713 ms 44932 KB Output is correct
55 Correct 2 ms 5200 KB Output is correct
56 Correct 3801 ms 44900 KB Output is correct
57 Execution timed out 4022 ms 44860 KB Time limit exceeded
58 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5200 KB Output is correct
2 Correct 2 ms 5072 KB Output is correct
3 Execution timed out 4064 ms 37616 KB Time limit exceeded
4 Halted 0 ms 0 KB -