oj.uz

Submission #964629

# Submission time Handle Problem Language Result Execution time Memory
964629 2024-04-17T08:33:41 Z kilkuwu Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 912 ms 127324 KB 
#include "jumps.h"

#include <bits/stdc++.h>

template<typename T, typename F>
struct SparseTable {
  std::vector<std::vector<T>> t;

  SparseTable() {}
  SparseTable(const std::vector<T>& a) : t(std::__lg(a.size()) + 1, std::vector<T>(a)) {
    for (int k = 0; k + 1 < (int) t.size(); k++)
      for (int i = 0; i + (1 << k) < (int) a.size(); i++)
        t[k + 1][i] = F()(t[k][i], t[k][i + (1 << k)]);
  }

  T query(int l, int r) {
    int k = std::__lg(r - l + 1);
    return F()(t[k][l], t[k][r - (1 << k) + 1]);
  }
};

template<typename T>
struct MaxMerge {
  T operator()(const T& a, const T& b) {
    return std::max<T>(a, b);
  }
};

constexpr int mxN = 200002, LOG = 20;
int L[LOG][mxN];
int cntL[LOG][mxN];
int R[LOG][mxN];
int cntR[LOG][mxN];
int N;

int prefer[LOG][mxN];
int cnt[LOG][mxN];

std::vector<int> H;

using ST = SparseTable<std::pair<int, int>, MaxMerge<std::pair<int, int>>>;

ST tab;

void init(int _N, std::vector<int> _H) {
  N = _N;
  H = _H;
  std::stack<int> st;
  for (int i = 0; i < N; i++) {
    while (st.size() && H[st.top()] <= H[i]) {
      st.pop();
    }
    L[0][i] = st.empty() ? i : st.top();
    cntL[0][i] = L[0][i] != i;
    st.push(i);
  }

  while (st.size()) st.pop();

  for (int i = N - 1; i >= 0; i--) {
    while (st.size() && H[st.top()] <= H[i]) {
      st.pop();
    }
    R[0][i] = st.empty() ? i : st.top();
    cntR[0][i] = R[0][i] != i;
    st.push(i);
  }

  std::vector<std::pair<int, int>> base(N);
  for (int i = 0; i < N; i++) base[i] = {H[i], i};
  tab = base;

  for (int i = 0; i < N; i++) {
    if (L[0][i] == i && R[0][i] == i) {
      prefer[0][i] = i;
      cnt[0][i] = 0;
      continue;
    } 

    cnt[0][i] = 1;
    if (L[0][i] == i) {
      prefer[0][i] = R[0][i];
    } else if (R[0][i] == i) {
      prefer[0][i] = L[0][i];
    } else {
      prefer[0][i] = H[L[0][i]] > H[R[0][i]] ? L[0][i] : R[0][i];
    }
  }

  for (int k = 0; k + 1 < LOG; k++) {
    for (int i = 0; i < N; i++) {
      prefer[k + 1][i] = prefer[k][prefer[k][i]];
      cnt[k + 1][i] = cnt[k][i] + cnt[k][prefer[k][i]];
      L[k + 1][i] = L[k][L[k][i]];
      R[k + 1][i] = R[k][R[k][i]];
      cntL[k + 1][i] = cntL[k][i] + cntL[k][L[k][i]];
      cntR[k + 1][i] = cntR[k][i] + cntR[k][R[k][i]];
    }
  }
}

int minimum_jumps(int A, int B, int C, int D) {
  int sz_mid = C - B - 1;

  auto br = tab.query(C, D);
  if (sz_mid > 0) {
    auto bmid = tab.query(B + 1, C - 1);

    if (bmid.first >= br.first) {
      return -1;
    }
  }

  if (H[B] >= br.first) return -1;

  int lb = A, rb = B;
  while (lb < rb) {
    int m = (lb + rb) / 2;

    if (tab.query(m, B).first < br.first) {
      rb = m;
    } else {
      lb = m + 1;
    }
  }

  auto best = tab.query(rb, B);
  int jumps = 0;
  int u = best.second;
  for (int k = LOG - 1; k >= 0; k--) {
    int to = prefer[k][u];
    if (H[to] >= H[C]) continue;
    jumps += cnt[k][u];
    u = to;
  }


  for (int k = LOG - 1; k >= 0; k--) {
    int to = R[k][u];
    if (to >= C) continue;
    jumps += cntR[k][u];
    u = to;
  }

  jumps++;
  return jumps;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 92752 KB Output is correct
2 Correct 10 ms 92760 KB Output is correct
3 Correct 128 ms 120116 KB Output is correct
4 Correct 912 ms 127148 KB Output is correct
5 Correct 716 ms 109168 KB Output is correct
6 Correct 900 ms 127120 KB Output is correct
7 Correct 672 ms 116340 KB Output is correct
8 Correct 883 ms 127156 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 92760 KB Output is correct
2 Correct 12 ms 92760 KB Output is correct
3 Correct 10 ms 92644 KB Output is correct
4 Correct 11 ms 92760 KB Output is correct
5 Correct 11 ms 92772 KB Output is correct
6 Incorrect 11 ms 92788 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 92760 KB Output is correct
2 Correct 12 ms 92760 KB Output is correct
3 Correct 10 ms 92644 KB Output is correct
4 Correct 11 ms 92760 KB Output is correct
5 Correct 11 ms 92772 KB Output is correct
6 Incorrect 11 ms 92788 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 92760 KB Output is correct
2 Correct 10 ms 92740 KB Output is correct
3 Correct 10 ms 92924 KB Output is correct
4 Correct 11 ms 92968 KB Output is correct
5 Correct 57 ms 119728 KB Output is correct
6 Correct 75 ms 126316 KB Output is correct
7 Correct 36 ms 109216 KB Output is correct
8 Correct 64 ms 126376 KB Output is correct
9 Correct 18 ms 97088 KB Output is correct
10 Correct 72 ms 126248 KB Output is correct
11 Correct 56 ms 127120 KB Output is correct
12 Correct 65 ms 126892 KB Output is correct
13 Incorrect 68 ms 127060 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 92764 KB Output is correct
2 Correct 11 ms 92760 KB Output is correct
3 Correct 10 ms 92764 KB Output is correct
4 Correct 154 ms 107352 KB Output is correct
5 Correct 628 ms 126364 KB Output is correct
6 Correct 414 ms 97860 KB Output is correct
7 Correct 608 ms 126388 KB Output is correct
8 Correct 353 ms 103832 KB Output is correct
9 Correct 635 ms 126288 KB Output is correct
10 Correct 810 ms 127128 KB Output is correct
11 Correct 793 ms 127040 KB Output is correct
12 Correct 796 ms 127136 KB Output is correct
13 Correct 635 ms 126272 KB Output is correct
14 Correct 802 ms 126828 KB Output is correct
15 Correct 626 ms 127136 KB Output is correct
16 Correct 643 ms 127144 KB Output is correct
17 Correct 11 ms 92760 KB Output is correct
18 Correct 10 ms 92760 KB Output is correct
19 Correct 11 ms 92760 KB Output is correct
20 Correct 10 ms 92760 KB Output is correct
21 Correct 11 ms 92760 KB Output is correct
22 Correct 11 ms 92764 KB Output is correct
23 Correct 10 ms 92760 KB Output is correct
24 Correct 11 ms 92760 KB Output is correct
25 Correct 10 ms 92680 KB Output is correct
26 Correct 10 ms 92868 KB Output is correct
27 Correct 19 ms 93272 KB Output is correct
28 Correct 20 ms 93016 KB Output is correct
29 Correct 17 ms 93016 KB Output is correct
30 Correct 22 ms 93116 KB Output is correct
31 Correct 20 ms 93028 KB Output is correct
32 Correct 10 ms 92760 KB Output is correct
33 Correct 47 ms 111328 KB Output is correct
34 Correct 71 ms 126344 KB Output is correct
35 Correct 58 ms 127140 KB Output is correct
36 Correct 62 ms 126300 KB Output is correct
37 Correct 59 ms 126756 KB Output is correct
38 Correct 56 ms 127204 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 92764 KB Output is correct
2 Correct 11 ms 92760 KB Output is correct
3 Correct 10 ms 92764 KB Output is correct
4 Correct 154 ms 107352 KB Output is correct
5 Correct 628 ms 126364 KB Output is correct
6 Correct 414 ms 97860 KB Output is correct
7 Correct 608 ms 126388 KB Output is correct
8 Correct 353 ms 103832 KB Output is correct
9 Correct 635 ms 126288 KB Output is correct
10 Correct 810 ms 127128 KB Output is correct
11 Correct 793 ms 127040 KB Output is correct
12 Correct 796 ms 127136 KB Output is correct
13 Correct 635 ms 126272 KB Output is correct
14 Correct 802 ms 126828 KB Output is correct
15 Correct 626 ms 127136 KB Output is correct
16 Correct 643 ms 127144 KB Output is correct
17 Correct 11 ms 92760 KB Output is correct
18 Correct 10 ms 92760 KB Output is correct
19 Correct 11 ms 92760 KB Output is correct
20 Correct 10 ms 92760 KB Output is correct
21 Correct 11 ms 92760 KB Output is correct
22 Correct 11 ms 92764 KB Output is correct
23 Correct 10 ms 92760 KB Output is correct
24 Correct 11 ms 92760 KB Output is correct
25 Correct 10 ms 92680 KB Output is correct
26 Correct 10 ms 92868 KB Output is correct
27 Correct 19 ms 93272 KB Output is correct
28 Correct 20 ms 93016 KB Output is correct
29 Correct 17 ms 93016 KB Output is correct
30 Correct 22 ms 93116 KB Output is correct
31 Correct 20 ms 93028 KB Output is correct
32 Correct 10 ms 92760 KB Output is correct
33 Correct 47 ms 111328 KB Output is correct
34 Correct 71 ms 126344 KB Output is correct
35 Correct 58 ms 127140 KB Output is correct
36 Correct 62 ms 126300 KB Output is correct
37 Correct 59 ms 126756 KB Output is correct
38 Correct 56 ms 127204 KB Output is correct
39 Correct 10 ms 92760 KB Output is correct
40 Correct 10 ms 92760 KB Output is correct
41 Correct 10 ms 92760 KB Output is correct
42 Correct 161 ms 107552 KB Output is correct
43 Correct 613 ms 126396 KB Output is correct
44 Correct 445 ms 97704 KB Output is correct
45 Correct 639 ms 126540 KB Output is correct
46 Correct 373 ms 103864 KB Output is correct
47 Correct 605 ms 126380 KB Output is correct
48 Correct 832 ms 127068 KB Output is correct
49 Correct 784 ms 127264 KB Output is correct
50 Correct 823 ms 126992 KB Output is correct
51 Correct 607 ms 126364 KB Output is correct
52 Correct 766 ms 126828 KB Output is correct
53 Correct 627 ms 127136 KB Output is correct
54 Correct 636 ms 127284 KB Output is correct
55 Correct 10 ms 92760 KB Output is correct
56 Correct 93 ms 126352 KB Output is correct
57 Correct 626 ms 126264 KB Output is correct
58 Correct 312 ms 98104 KB Output is correct
59 Correct 592 ms 126420 KB Output is correct
60 Correct 266 ms 104108 KB Output is correct
61 Correct 594 ms 126356 KB Output is correct
62 Correct 862 ms 127152 KB Output is correct
63 Correct 789 ms 127040 KB Output is correct
64 Correct 778 ms 126880 KB Output is correct
65 Correct 634 ms 126372 KB Output is correct
66 Correct 770 ms 126824 KB Output is correct
67 Correct 662 ms 127324 KB Output is correct
68 Correct 630 ms 127060 KB Output is correct
69 Correct 12 ms 92628 KB Output is correct
70 Correct 10 ms 92760 KB Output is correct
71 Correct 10 ms 92668 KB Output is correct
72 Correct 11 ms 92760 KB Output is correct
73 Correct 11 ms 92760 KB Output is correct
74 Correct 12 ms 92760 KB Output is correct
75 Correct 11 ms 92748 KB Output is correct
76 Correct 10 ms 92760 KB Output is correct
77 Correct 10 ms 92760 KB Output is correct
78 Correct 11 ms 92760 KB Output is correct
79 Correct 11 ms 92760 KB Output is correct
80 Correct 11 ms 92760 KB Output is correct
81 Correct 11 ms 92760 KB Output is correct
82 Correct 11 ms 92740 KB Output is correct
83 Correct 11 ms 92760 KB Output is correct
84 Correct 10 ms 92788 KB Output is correct
85 Correct 12 ms 92760 KB Output is correct
86 Correct 20 ms 93016 KB Output is correct
87 Correct 20 ms 93016 KB Output is correct
88 Correct 19 ms 93032 KB Output is correct
89 Correct 23 ms 93016 KB Output is correct
90 Correct 21 ms 93036 KB Output is correct
91 Correct 12 ms 92760 KB Output is correct
92 Correct 12 ms 92876 KB Output is correct
93 Correct 20 ms 93028 KB Output is correct
94 Correct 21 ms 93032 KB Output is correct
95 Correct 20 ms 93028 KB Output is correct
96 Correct 19 ms 93016 KB Output is correct
97 Correct 22 ms 93036 KB Output is correct
98 Correct 10 ms 92764 KB Output is correct
99 Correct 67 ms 126372 KB Output is correct
100 Correct 72 ms 126284 KB Output is correct
101 Correct 61 ms 126880 KB Output is correct
102 Correct 76 ms 126240 KB Output is correct
103 Correct 63 ms 126644 KB Output is correct
104 Correct 64 ms 127296 KB Output is correct
105 Correct 10 ms 92772 KB Output is correct
106 Correct 40 ms 111392 KB Output is correct
107 Correct 62 ms 126368 KB Output is correct
108 Correct 67 ms 127048 KB Output is correct
109 Correct 60 ms 126464 KB Output is correct
110 Correct 59 ms 126668 KB Output is correct
111 Correct 63 ms 127164 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 92752 KB Output is correct
2 Correct 10 ms 92760 KB Output is correct
3 Correct 128 ms 120116 KB Output is correct
4 Correct 912 ms 127148 KB Output is correct
5 Correct 716 ms 109168 KB Output is correct
6 Correct 900 ms 127120 KB Output is correct
7 Correct 672 ms 116340 KB Output is correct
8 Correct 883 ms 127156 KB Output is correct
9 Correct 10 ms 92760 KB Output is correct
10 Correct 12 ms 92760 KB Output is correct
11 Correct 10 ms 92644 KB Output is correct
12 Correct 11 ms 92760 KB Output is correct
13 Correct 11 ms 92772 KB Output is correct
14 Incorrect 11 ms 92788 KB Output isn't correct
15 Halted 0 ms 0 KB -