oj.uz

Submission #716168

# Submission time Handle Problem Language Result Execution time Memory
716168 2023-03-29T07:13:49 Z schiftyfive4 Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1537 ms 75400 KB 
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) "MJ >> LAMELO"
#endif

template <typename T, class F = function<T(const T&, const T&)>>
struct sparse_table {
  int n;
  vector<vector<T>> mat;
  F func;
  sparse_table() {}
  sparse_table(const vector<T>& a, const F& f) : func(f) {
    n = static_cast<int>(a.size());
    int max_log = 32 - __builtin_clz(n);
    mat.resize(max_log);
    mat[0] = a;
    for (int j = 1; j < max_log; j++) {
      mat[j].resize(n - (1 << j) + 1);
      for (int i = 0; i <= n - (1 << j); i++) {
        mat[j][i] = func(mat[j - 1][i], mat[j - 1][i + (1 << (j - 1))]);
      }
    }
  }
  T get(int L, int R) const {
    assert(0 <= L && L <= R && R <= n - 1);
    int lg = 32 - __builtin_clz(R - L + 1) - 1;
    return func(mat[lg][L], mat[lg][R - (1 << lg) + 1]);
  }
};

const int lg = 20;
vector<int> h;
vector<vector<int>> g;
vector<vector<int>> go_low;
vector<vector<int>> go_high;
sparse_table<int> st;
int n;

void init(int N, vector<int> H) {
  n = N;
  h = H;
  h.push_back(1e9);
  g.resize(n + 1);
  vector<int> t;
  for (int i = 0; i < n; i++) {
    while (!t.empty() && h[i] > h[t.back()]) {
      t.pop_back();
    }
    if (!t.empty()) {
      g[i].push_back(t.back());
    }
    t.push_back(i);
  }
  t.clear();
  for (int i = n - 1; i >= 0; i--) {
    while (!t.empty() && h[i] > h[t.back()]) {
      t.pop_back();
    }
    if (!t.empty()) {
      g[i].push_back(t.back());
    }
    t.push_back(i);
  }
  for (int i = 0; i < n; i++) {
    if (g[i].size() == 2 && h[g[i][0]] > h[g[i][1]]) {
      swap(g[i][0], g[i][1]);
    }
  }
  go_low = vector<vector<int>>(n + 1, vector<int>(lg));
  go_high = vector<vector<int>>(n + 1, vector<int>(lg));
  for (int i = 0; i <= n; i++) {
    go_low[i][0] = go_high[i][0] = n;
    if (g[i].size() > 0) {
      go_low[i][0] = g[i][0];
    }
    if (g[i].size() > 1){
      go_high[i][0] = g[i][1];
    }
  }
  for (int b = 1; b < lg; b++) {
    for (int i = 0; i <= n; i++) {
      go_low[i][b] = go_low[go_low[i][b - 1]][b - 1];
      go_high[i][b] = go_high[go_high[i][b - 1]][b - 1];
    }
  }
  vector<int> p(n);
  iota(p.begin(), p.end(), 0);
  st = sparse_table<int>(p, [&](int i, int j) { return h[i] > h[j] ? i : j; });
}

int minimum_jumps(int a, int b, int c, int d) {
  int x = st.get(c, d);
  if (h[st.get(b, c - 1)] > h[x]) {
    return -1;
  }
  int l = a;
  int r = b;
  while (l < r) {
    int mid = (l + r) >> 1;
    int pos = st.get(mid, b);
    if (h[pos] > h[x]) {
      l = mid + 1;
    } else {
      r = mid;
    }
  }
  int s = st.get(l, b);
  l = c;
  r = d;
  int val = h[st.get(s, c - 1)];
  while (l < r) {
    int mid = (l + r) >> 1;
    int pos = st.get(c, mid);
    if (h[pos] > val) {
      r = mid;
    } else {
      l = mid + 1;
    }
  }
  int t = l;
  int ans = 0;
  for (int b = lg - 1; b >= 0; b--) {
    int ns = go_high[s][b];
    if (h[ns] <= h[t]) {
      s = ns;
      ans += (1 << b);
    }
  }
  if (s == t) {
    return ans;
  }
  if (h[go_high[s][0]] < h[x]) {
    return ans + 2;
  }
  for (int b = lg - 1; b >= 0; b--) {
    int ns = go_low[s][b];
    if (h[ns] <= h[t]) {
      s = ns;
      ans += (1 << b);
    }
  }
  return ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 259 ms 59640 KB Output is correct
4 Correct 1537 ms 75176 KB Output is correct
5 Correct 1121 ms 37648 KB Output is correct
6 Correct 1487 ms 75184 KB Output is correct
7 Correct 1145 ms 51200 KB Output is correct
8 Correct 1533 ms 75184 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Incorrect 3 ms 336 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Incorrect 3 ms 336 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 135 ms 59696 KB Output is correct
6 Correct 159 ms 74396 KB Output is correct
7 Correct 82 ms 37812 KB Output is correct
8 Correct 161 ms 74360 KB Output is correct
9 Correct 21 ms 11128 KB Output is correct
10 Correct 167 ms 74364 KB Output is correct
11 Correct 169 ms 75160 KB Output is correct
12 Correct 149 ms 74940 KB Output is correct
13 Correct 154 ms 74992 KB Output is correct
14 Correct 158 ms 74376 KB Output is correct
15 Incorrect 189 ms 74808 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 290 ms 33664 KB Output is correct
5 Correct 1102 ms 74400 KB Output is correct
6 Correct 618 ms 12072 KB Output is correct
7 Correct 795 ms 74352 KB Output is correct
8 Correct 616 ms 25352 KB Output is correct
9 Correct 1143 ms 74380 KB Output is correct
10 Correct 1102 ms 75144 KB Output is correct
11 Correct 1239 ms 75100 KB Output is correct
12 Correct 1213 ms 75016 KB Output is correct
13 Correct 998 ms 74392 KB Output is correct
14 Correct 1283 ms 74812 KB Output is correct
15 Correct 998 ms 75144 KB Output is correct
16 Correct 879 ms 75320 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 21 ms 976 KB Output is correct
28 Correct 23 ms 976 KB Output is correct
29 Correct 21 ms 976 KB Output is correct
30 Correct 23 ms 976 KB Output is correct
31 Correct 19 ms 976 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 98 ms 42764 KB Output is correct
34 Correct 167 ms 74380 KB Output is correct
35 Correct 151 ms 75020 KB Output is correct
36 Correct 163 ms 74404 KB Output is correct
37 Correct 218 ms 74784 KB Output is correct
38 Correct 153 ms 75400 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 290 ms 33664 KB Output is correct
5 Correct 1102 ms 74400 KB Output is correct
6 Correct 618 ms 12072 KB Output is correct
7 Correct 795 ms 74352 KB Output is correct
8 Correct 616 ms 25352 KB Output is correct
9 Correct 1143 ms 74380 KB Output is correct
10 Correct 1102 ms 75144 KB Output is correct
11 Correct 1239 ms 75100 KB Output is correct
12 Correct 1213 ms 75016 KB Output is correct
13 Correct 998 ms 74392 KB Output is correct
14 Correct 1283 ms 74812 KB Output is correct
15 Correct 998 ms 75144 KB Output is correct
16 Correct 879 ms 75320 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 21 ms 976 KB Output is correct
28 Correct 23 ms 976 KB Output is correct
29 Correct 21 ms 976 KB Output is correct
30 Correct 23 ms 976 KB Output is correct
31 Correct 19 ms 976 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 98 ms 42764 KB Output is correct
34 Correct 167 ms 74380 KB Output is correct
35 Correct 151 ms 75020 KB Output is correct
36 Correct 163 ms 74404 KB Output is correct
37 Correct 218 ms 74784 KB Output is correct
38 Correct 153 ms 75400 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 1 ms 208 KB Output is correct
42 Correct 298 ms 33776 KB Output is correct
43 Correct 1087 ms 74396 KB Output is correct
44 Correct 595 ms 12108 KB Output is correct
45 Correct 1002 ms 74416 KB Output is correct
46 Correct 618 ms 25452 KB Output is correct
47 Correct 1120 ms 74364 KB Output is correct
48 Correct 1251 ms 75192 KB Output is correct
49 Correct 1297 ms 75116 KB Output is correct
50 Correct 1272 ms 75064 KB Output is correct
51 Correct 1083 ms 74296 KB Output is correct
52 Correct 1200 ms 74808 KB Output is correct
53 Correct 1095 ms 75184 KB Output is correct
54 Correct 854 ms 75192 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Correct 246 ms 74012 KB Output is correct
57 Correct 1133 ms 74300 KB Output is correct
58 Correct 416 ms 12860 KB Output is correct
59 Correct 997 ms 74404 KB Output is correct
60 Correct 472 ms 26284 KB Output is correct
61 Correct 1102 ms 74424 KB Output is correct
62 Correct 1354 ms 75176 KB Output is correct
63 Correct 1043 ms 74908 KB Output is correct
64 Correct 1156 ms 74904 KB Output is correct
65 Correct 918 ms 74376 KB Output is correct
66 Correct 1294 ms 74720 KB Output is correct
67 Correct 979 ms 75184 KB Output is correct
68 Correct 971 ms 75276 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 1 ms 208 KB Output is correct
71 Correct 3 ms 336 KB Output is correct
72 Correct 3 ms 336 KB Output is correct
73 Correct 2 ms 336 KB Output is correct
74 Correct 2 ms 336 KB Output is correct
75 Correct 3 ms 336 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 0 ms 208 KB Output is correct
78 Correct 2 ms 208 KB Output is correct
79 Correct 2 ms 336 KB Output is correct
80 Correct 3 ms 336 KB Output is correct
81 Correct 2 ms 336 KB Output is correct
82 Correct 2 ms 336 KB Output is correct
83 Correct 3 ms 336 KB Output is correct
84 Correct 1 ms 336 KB Output is correct
85 Correct 3 ms 336 KB Output is correct
86 Correct 17 ms 976 KB Output is correct
87 Correct 15 ms 976 KB Output is correct
88 Correct 19 ms 976 KB Output is correct
89 Correct 21 ms 976 KB Output is correct
90 Correct 21 ms 976 KB Output is correct
91 Correct 1 ms 336 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 21 ms 976 KB Output is correct
94 Correct 16 ms 976 KB Output is correct
95 Correct 17 ms 976 KB Output is correct
96 Correct 20 ms 976 KB Output is correct
97 Correct 11 ms 976 KB Output is correct
98 Correct 0 ms 208 KB Output is correct
99 Correct 157 ms 74216 KB Output is correct
100 Correct 155 ms 74408 KB Output is correct
101 Correct 150 ms 74936 KB Output is correct
102 Correct 158 ms 74380 KB Output is correct
103 Correct 178 ms 74788 KB Output is correct
104 Correct 150 ms 75272 KB Output is correct
105 Correct 0 ms 208 KB Output is correct
106 Correct 95 ms 42740 KB Output is correct
107 Correct 162 ms 74384 KB Output is correct
108 Correct 149 ms 75180 KB Output is correct
109 Correct 159 ms 74392 KB Output is correct
110 Correct 194 ms 74808 KB Output is correct
111 Correct 148 ms 75172 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 259 ms 59640 KB Output is correct
4 Correct 1537 ms 75176 KB Output is correct
5 Correct 1121 ms 37648 KB Output is correct
6 Correct 1487 ms 75184 KB Output is correct
7 Correct 1145 ms 51200 KB Output is correct
8 Correct 1533 ms 75184 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Incorrect 3 ms 336 KB Output isn't correct
15 Halted 0 ms 0 KB -