oj.uz

Submission #964632

# Submission time Handle Problem Language Result Execution time Memory
964632 2024-04-17T08:39:56 Z kilkuwu Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 938 ms 127296 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] >= br.first) continue;
    jumps += cnt[k][u];
    u = to;
  }


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

  jumps++;
  return jumps;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 92752 KB Output is correct
2 Correct 10 ms 92760 KB Output is correct
3 Incorrect 147 ms 120104 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 92760 KB Output is correct
2 Correct 13 ms 92760 KB Output is correct
3 Correct 10 ms 92592 KB Output is correct
4 Correct 11 ms 93020 KB Output is correct
5 Incorrect 11 ms 92760 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 92760 KB Output is correct
2 Correct 13 ms 92760 KB Output is correct
3 Correct 10 ms 92592 KB Output is correct
4 Correct 11 ms 93020 KB Output is correct
5 Incorrect 11 ms 92760 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 92700 KB Output is correct
2 Correct 10 ms 92760 KB Output is correct
3 Correct 10 ms 92772 KB Output is correct
4 Correct 10 ms 92760 KB Output is correct
5 Correct 66 ms 119804 KB Output is correct
6 Correct 72 ms 126268 KB Output is correct
7 Correct 44 ms 109048 KB Output is correct
8 Correct 71 ms 126416 KB Output is correct
9 Correct 20 ms 97036 KB Output is correct
10 Correct 70 ms 126240 KB Output is correct
11 Incorrect 65 ms 127088 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 92760 KB Output is correct
2 Correct 10 ms 92760 KB Output is correct
3 Correct 11 ms 92740 KB Output is correct
4 Correct 174 ms 107444 KB Output is correct
5 Correct 635 ms 126492 KB Output is correct
6 Correct 444 ms 97612 KB Output is correct
7 Correct 655 ms 126332 KB Output is correct
8 Correct 399 ms 103736 KB Output is correct
9 Correct 664 ms 126348 KB Output is correct
10 Correct 857 ms 127200 KB Output is correct
11 Correct 863 ms 127032 KB Output is correct
12 Correct 864 ms 126992 KB Output is correct
13 Correct 676 ms 126344 KB Output is correct
14 Correct 799 ms 126732 KB Output is correct
15 Correct 687 ms 127068 KB Output is correct
16 Correct 687 ms 127292 KB Output is correct
17 Correct 11 ms 92720 KB Output is correct
18 Correct 11 ms 92760 KB Output is correct
19 Correct 11 ms 92752 KB Output is correct
20 Correct 11 ms 92760 KB Output is correct
21 Correct 13 ms 92920 KB Output is correct
22 Correct 13 ms 92796 KB Output is correct
23 Correct 11 ms 92760 KB Output is correct
24 Correct 12 ms 92760 KB Output is correct
25 Correct 10 ms 92760 KB Output is correct
26 Correct 10 ms 92868 KB Output is correct
27 Correct 22 ms 93016 KB Output is correct
28 Correct 22 ms 93016 KB Output is correct
29 Correct 21 ms 93016 KB Output is correct
30 Correct 23 ms 93016 KB Output is correct
31 Correct 21 ms 93024 KB Output is correct
32 Correct 10 ms 92764 KB Output is correct
33 Correct 48 ms 111312 KB Output is correct
34 Correct 72 ms 126324 KB Output is correct
35 Correct 70 ms 126960 KB Output is correct
36 Correct 72 ms 126312 KB Output is correct
37 Correct 73 ms 126924 KB Output is correct
38 Correct 65 ms 127132 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 92760 KB Output is correct
2 Correct 10 ms 92760 KB Output is correct
3 Correct 11 ms 92740 KB Output is correct
4 Correct 174 ms 107444 KB Output is correct
5 Correct 635 ms 126492 KB Output is correct
6 Correct 444 ms 97612 KB Output is correct
7 Correct 655 ms 126332 KB Output is correct
8 Correct 399 ms 103736 KB Output is correct
9 Correct 664 ms 126348 KB Output is correct
10 Correct 857 ms 127200 KB Output is correct
11 Correct 863 ms 127032 KB Output is correct
12 Correct 864 ms 126992 KB Output is correct
13 Correct 676 ms 126344 KB Output is correct
14 Correct 799 ms 126732 KB Output is correct
15 Correct 687 ms 127068 KB Output is correct
16 Correct 687 ms 127292 KB Output is correct
17 Correct 11 ms 92720 KB Output is correct
18 Correct 11 ms 92760 KB Output is correct
19 Correct 11 ms 92752 KB Output is correct
20 Correct 11 ms 92760 KB Output is correct
21 Correct 13 ms 92920 KB Output is correct
22 Correct 13 ms 92796 KB Output is correct
23 Correct 11 ms 92760 KB Output is correct
24 Correct 12 ms 92760 KB Output is correct
25 Correct 10 ms 92760 KB Output is correct
26 Correct 10 ms 92868 KB Output is correct
27 Correct 22 ms 93016 KB Output is correct
28 Correct 22 ms 93016 KB Output is correct
29 Correct 21 ms 93016 KB Output is correct
30 Correct 23 ms 93016 KB Output is correct
31 Correct 21 ms 93024 KB Output is correct
32 Correct 10 ms 92764 KB Output is correct
33 Correct 48 ms 111312 KB Output is correct
34 Correct 72 ms 126324 KB Output is correct
35 Correct 70 ms 126960 KB Output is correct
36 Correct 72 ms 126312 KB Output is correct
37 Correct 73 ms 126924 KB Output is correct
38 Correct 65 ms 127132 KB Output is correct
39 Correct 12 ms 92756 KB Output is correct
40 Correct 10 ms 92760 KB Output is correct
41 Correct 10 ms 92760 KB Output is correct
42 Correct 177 ms 107496 KB Output is correct
43 Correct 651 ms 126360 KB Output is correct
44 Correct 421 ms 97888 KB Output is correct
45 Correct 659 ms 126368 KB Output is correct
46 Correct 406 ms 103752 KB Output is correct
47 Correct 654 ms 126412 KB Output is correct
48 Correct 863 ms 127120 KB Output is correct
49 Correct 856 ms 127036 KB Output is correct
50 Correct 932 ms 127132 KB Output is correct
51 Correct 644 ms 126268 KB Output is correct
52 Correct 825 ms 126772 KB Output is correct
53 Correct 648 ms 127104 KB Output is correct
54 Correct 637 ms 127104 KB Output is correct
55 Correct 12 ms 92772 KB Output is correct
56 Correct 97 ms 126156 KB Output is correct
57 Correct 657 ms 126368 KB Output is correct
58 Correct 345 ms 97968 KB Output is correct
59 Correct 649 ms 126468 KB Output is correct
60 Correct 299 ms 104064 KB Output is correct
61 Correct 668 ms 126352 KB Output is correct
62 Correct 938 ms 127088 KB Output is correct
63 Correct 873 ms 126872 KB Output is correct
64 Correct 838 ms 127012 KB Output is correct
65 Correct 631 ms 126424 KB Output is correct
66 Correct 789 ms 126644 KB Output is correct
67 Correct 677 ms 127288 KB Output is correct
68 Correct 651 ms 127108 KB Output is correct
69 Correct 10 ms 92760 KB Output is correct
70 Correct 11 ms 92760 KB Output is correct
71 Correct 12 ms 92760 KB Output is correct
72 Correct 11 ms 92760 KB Output is correct
73 Correct 12 ms 92760 KB Output is correct
74 Correct 13 ms 92760 KB Output is correct
75 Correct 13 ms 92760 KB Output is correct
76 Correct 11 ms 92760 KB Output is correct
77 Correct 10 ms 92772 KB Output is correct
78 Correct 11 ms 92632 KB Output is correct
79 Correct 13 ms 92760 KB Output is correct
80 Correct 12 ms 92760 KB Output is correct
81 Correct 13 ms 92732 KB Output is correct
82 Correct 11 ms 92716 KB Output is correct
83 Correct 11 ms 92688 KB Output is correct
84 Correct 11 ms 93012 KB Output is correct
85 Correct 13 ms 92760 KB Output is correct
86 Correct 23 ms 93268 KB Output is correct
87 Correct 19 ms 93020 KB Output is correct
88 Correct 19 ms 93016 KB Output is correct
89 Correct 22 ms 93016 KB Output is correct
90 Correct 19 ms 93032 KB Output is correct
91 Correct 10 ms 92788 KB Output is correct
92 Correct 11 ms 93016 KB Output is correct
93 Correct 22 ms 93016 KB Output is correct
94 Correct 28 ms 93012 KB Output is correct
95 Correct 19 ms 93016 KB Output is correct
96 Correct 20 ms 93016 KB Output is correct
97 Correct 20 ms 93264 KB Output is correct
98 Correct 11 ms 92756 KB Output is correct
99 Correct 66 ms 126408 KB Output is correct
100 Correct 68 ms 126456 KB Output is correct
101 Correct 62 ms 127092 KB Output is correct
102 Correct 65 ms 126280 KB Output is correct
103 Correct 70 ms 126836 KB Output is correct
104 Correct 58 ms 127296 KB Output is correct
105 Correct 11 ms 92760 KB Output is correct
106 Correct 41 ms 111340 KB Output is correct
107 Correct 65 ms 126280 KB Output is correct
108 Correct 57 ms 127176 KB Output is correct
109 Correct 62 ms 126384 KB Output is correct
110 Correct 68 ms 126660 KB Output is correct
111 Correct 59 ms 127096 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 92752 KB Output is correct
2 Correct 10 ms 92760 KB Output is correct
3 Incorrect 147 ms 120104 KB Output isn't correct
4 Halted 0 ms 0 KB -