oj.uz

Submission #964645

# Submission time Handle Problem Language Result Execution time Memory
964645 2024-04-17T09:08:48 Z kilkuwu Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 979 ms 127320 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);
  }
};
template<typename T>
struct MinMerge {
  T operator()(const T& a, const T& b) {
    return std::min<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>>>;
using ST2 = SparseTable<std::pair<int, int>, MinMerge<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);
  int thres = H[B];

  if (sz_mid > 0) {
    auto bmid = tab.query(B + 1, C - 1);
    thres = std::max(thres, bmid.first);
  }

  if (thres >= 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);
  thres = std::max(thres, best.first);
  int jumps = 0;
  int u = best.second;

  lb = C, rb = br.second;
  while (lb < rb) {
    int m = (lb + rb) / 2;
    if (tab.query(C, m).first > thres) {
      rb = m; 
    } else {
      lb = m + 1;
    }
  }

  int f = rb;
  int e = br.second; 

  for (int k = LOG - 1; k >= 0; k--) {
    int to = prefer[k][u];
    if (H[to] >= H[f]) continue;
    jumps += cnt[k][u];
    u = to;
  }

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

  jumps++;
  return jumps;
}

/*
5 1
5 2 2 3 6
0 0 3 4
*/

Compilation message

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:151:7: warning: unused variable 'e' [-Wunused-variable]
  151 |   int e = br.second;
      |       ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 92704 KB Output is correct
2 Correct 12 ms 92760 KB Output is correct
3 Correct 131 ms 120148 KB Output is correct
4 Correct 979 ms 127088 KB Output is correct
5 Correct 797 ms 109376 KB Output is correct
6 Correct 918 ms 127128 KB Output is correct
7 Correct 756 ms 116376 KB Output is correct
8 Correct 949 ms 127300 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 92656 KB Output is correct
2 Correct 11 ms 92760 KB Output is correct
3 Correct 10 ms 92644 KB Output is correct
4 Correct 9 ms 92760 KB Output is correct
5 Correct 11 ms 92760 KB Output is correct
6 Correct 10 ms 92760 KB Output is correct
7 Correct 10 ms 92760 KB Output is correct
8 Correct 11 ms 92760 KB Output is correct
9 Correct 10 ms 92792 KB Output is correct
10 Correct 11 ms 92756 KB Output is correct
11 Correct 11 ms 92760 KB Output is correct
12 Correct 12 ms 92760 KB Output is correct
13 Incorrect 13 ms 92760 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 92656 KB Output is correct
2 Correct 11 ms 92760 KB Output is correct
3 Correct 10 ms 92644 KB Output is correct
4 Correct 9 ms 92760 KB Output is correct
5 Correct 11 ms 92760 KB Output is correct
6 Correct 10 ms 92760 KB Output is correct
7 Correct 10 ms 92760 KB Output is correct
8 Correct 11 ms 92760 KB Output is correct
9 Correct 10 ms 92792 KB Output is correct
10 Correct 11 ms 92756 KB Output is correct
11 Correct 11 ms 92760 KB Output is correct
12 Correct 12 ms 92760 KB Output is correct
13 Incorrect 13 ms 92760 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 92776 KB Output is correct
2 Correct 11 ms 92760 KB Output is correct
3 Correct 10 ms 92760 KB Output is correct
4 Correct 10 ms 92768 KB Output is correct
5 Correct 57 ms 119892 KB Output is correct
6 Correct 70 ms 126420 KB Output is correct
7 Correct 37 ms 109084 KB Output is correct
8 Correct 65 ms 126412 KB Output is correct
9 Correct 18 ms 97084 KB Output is correct
10 Correct 70 ms 126344 KB Output is correct
11 Correct 55 ms 127132 KB Output is correct
12 Correct 63 ms 126880 KB Output is correct
13 Incorrect 59 ms 126860 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 92760 KB Output is correct
2 Correct 10 ms 92760 KB Output is correct
3 Correct 10 ms 92760 KB Output is correct
4 Correct 166 ms 107364 KB Output is correct
5 Correct 635 ms 126360 KB Output is correct
6 Correct 407 ms 97864 KB Output is correct
7 Correct 611 ms 126364 KB Output is correct
8 Correct 371 ms 103672 KB Output is correct
9 Correct 591 ms 126304 KB Output is correct
10 Correct 867 ms 127304 KB Output is correct
11 Correct 821 ms 127212 KB Output is correct
12 Correct 827 ms 126988 KB Output is correct
13 Correct 626 ms 126456 KB Output is correct
14 Correct 799 ms 126640 KB Output is correct
15 Correct 640 ms 127132 KB Output is correct
16 Correct 655 ms 127172 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 92644 KB Output is correct
20 Correct 11 ms 92760 KB Output is correct
21 Correct 11 ms 92760 KB Output is correct
22 Correct 11 ms 92760 KB Output is correct
23 Correct 11 ms 92760 KB Output is correct
24 Correct 11 ms 92760 KB Output is correct
25 Correct 10 ms 92760 KB Output is correct
26 Correct 10 ms 93016 KB Output is correct
27 Correct 22 ms 93024 KB Output is correct
28 Correct 23 ms 93264 KB Output is correct
29 Correct 23 ms 93028 KB Output is correct
30 Correct 20 ms 93020 KB Output is correct
31 Correct 20 ms 93040 KB Output is correct
32 Correct 11 ms 92760 KB Output is correct
33 Correct 41 ms 111340 KB Output is correct
34 Correct 69 ms 126380 KB Output is correct
35 Correct 68 ms 127144 KB Output is correct
36 Correct 70 ms 126368 KB Output is correct
37 Correct 57 ms 126824 KB Output is correct
38 Correct 57 ms 127144 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 92760 KB Output is correct
2 Correct 10 ms 92760 KB Output is correct
3 Correct 10 ms 92760 KB Output is correct
4 Correct 166 ms 107364 KB Output is correct
5 Correct 635 ms 126360 KB Output is correct
6 Correct 407 ms 97864 KB Output is correct
7 Correct 611 ms 126364 KB Output is correct
8 Correct 371 ms 103672 KB Output is correct
9 Correct 591 ms 126304 KB Output is correct
10 Correct 867 ms 127304 KB Output is correct
11 Correct 821 ms 127212 KB Output is correct
12 Correct 827 ms 126988 KB Output is correct
13 Correct 626 ms 126456 KB Output is correct
14 Correct 799 ms 126640 KB Output is correct
15 Correct 640 ms 127132 KB Output is correct
16 Correct 655 ms 127172 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 92644 KB Output is correct
20 Correct 11 ms 92760 KB Output is correct
21 Correct 11 ms 92760 KB Output is correct
22 Correct 11 ms 92760 KB Output is correct
23 Correct 11 ms 92760 KB Output is correct
24 Correct 11 ms 92760 KB Output is correct
25 Correct 10 ms 92760 KB Output is correct
26 Correct 10 ms 93016 KB Output is correct
27 Correct 22 ms 93024 KB Output is correct
28 Correct 23 ms 93264 KB Output is correct
29 Correct 23 ms 93028 KB Output is correct
30 Correct 20 ms 93020 KB Output is correct
31 Correct 20 ms 93040 KB Output is correct
32 Correct 11 ms 92760 KB Output is correct
33 Correct 41 ms 111340 KB Output is correct
34 Correct 69 ms 126380 KB Output is correct
35 Correct 68 ms 127144 KB Output is correct
36 Correct 70 ms 126368 KB Output is correct
37 Correct 57 ms 126824 KB Output is correct
38 Correct 57 ms 127144 KB Output is correct
39 Correct 11 ms 92760 KB Output is correct
40 Correct 11 ms 92760 KB Output is correct
41 Correct 10 ms 92760 KB Output is correct
42 Correct 164 ms 107356 KB Output is correct
43 Correct 657 ms 126280 KB Output is correct
44 Correct 418 ms 97620 KB Output is correct
45 Correct 625 ms 126452 KB Output is correct
46 Correct 359 ms 103852 KB Output is correct
47 Correct 660 ms 126384 KB Output is correct
48 Correct 858 ms 127136 KB Output is correct
49 Correct 808 ms 127152 KB Output is correct
50 Correct 783 ms 127200 KB Output is correct
51 Correct 651 ms 126360 KB Output is correct
52 Correct 783 ms 126620 KB Output is correct
53 Correct 647 ms 127060 KB Output is correct
54 Correct 615 ms 127292 KB Output is correct
55 Correct 10 ms 92760 KB Output is correct
56 Correct 105 ms 126372 KB Output is correct
57 Correct 636 ms 126472 KB Output is correct
58 Correct 303 ms 98116 KB Output is correct
59 Correct 596 ms 126356 KB Output is correct
60 Correct 255 ms 104228 KB Output is correct
61 Correct 623 ms 126376 KB Output is correct
62 Correct 893 ms 127284 KB Output is correct
63 Correct 832 ms 126952 KB Output is correct
64 Correct 806 ms 126868 KB Output is correct
65 Correct 637 ms 126288 KB Output is correct
66 Correct 833 ms 126824 KB Output is correct
67 Correct 697 ms 127148 KB Output is correct
68 Correct 655 ms 127132 KB Output is correct
69 Correct 11 ms 92760 KB Output is correct
70 Correct 11 ms 92744 KB Output is correct
71 Correct 12 ms 92760 KB Output is correct
72 Correct 11 ms 92760 KB Output is correct
73 Correct 11 ms 92760 KB Output is correct
74 Correct 10 ms 92760 KB Output is correct
75 Correct 12 ms 92760 KB Output is correct
76 Correct 10 ms 93016 KB Output is correct
77 Correct 10 ms 92556 KB Output is correct
78 Correct 11 ms 92760 KB Output is correct
79 Correct 12 ms 92760 KB Output is correct
80 Correct 11 ms 92760 KB Output is correct
81 Correct 13 ms 92760 KB Output is correct
82 Correct 11 ms 92760 KB Output is correct
83 Correct 12 ms 92656 KB Output is correct
84 Correct 12 ms 92760 KB Output is correct
85 Correct 13 ms 93008 KB Output is correct
86 Correct 18 ms 93016 KB Output is correct
87 Correct 24 ms 93220 KB Output is correct
88 Correct 20 ms 93024 KB Output is correct
89 Correct 21 ms 93020 KB Output is correct
90 Correct 19 ms 93016 KB Output is correct
91 Correct 10 ms 92760 KB Output is correct
92 Correct 11 ms 92872 KB Output is correct
93 Correct 19 ms 93016 KB Output is correct
94 Correct 22 ms 93016 KB Output is correct
95 Correct 23 ms 93016 KB Output is correct
96 Correct 19 ms 93016 KB Output is correct
97 Correct 22 ms 93016 KB Output is correct
98 Correct 10 ms 92760 KB Output is correct
99 Correct 77 ms 126384 KB Output is correct
100 Correct 63 ms 126404 KB Output is correct
101 Correct 56 ms 127116 KB Output is correct
102 Correct 77 ms 126396 KB Output is correct
103 Correct 69 ms 126820 KB Output is correct
104 Correct 71 ms 127180 KB Output is correct
105 Correct 10 ms 92760 KB Output is correct
106 Correct 46 ms 111428 KB Output is correct
107 Correct 63 ms 126260 KB Output is correct
108 Correct 60 ms 126964 KB Output is correct
109 Correct 77 ms 126232 KB Output is correct
110 Correct 66 ms 126820 KB Output is correct
111 Correct 62 ms 127320 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 92704 KB Output is correct
2 Correct 12 ms 92760 KB Output is correct
3 Correct 131 ms 120148 KB Output is correct
4 Correct 979 ms 127088 KB Output is correct
5 Correct 797 ms 109376 KB Output is correct
6 Correct 918 ms 127128 KB Output is correct
7 Correct 756 ms 116376 KB Output is correct
8 Correct 949 ms 127300 KB Output is correct
9 Correct 18 ms 92656 KB Output is correct
10 Correct 11 ms 92760 KB Output is correct
11 Correct 10 ms 92644 KB Output is correct
12 Correct 9 ms 92760 KB Output is correct
13 Correct 11 ms 92760 KB Output is correct
14 Correct 10 ms 92760 KB Output is correct
15 Correct 10 ms 92760 KB Output is correct
16 Correct 11 ms 92760 KB Output is correct
17 Correct 10 ms 92792 KB Output is correct
18 Correct 11 ms 92756 KB Output is correct
19 Correct 11 ms 92760 KB Output is correct
20 Correct 12 ms 92760 KB Output is correct
21 Incorrect 13 ms 92760 KB Output isn't correct
22 Halted 0 ms 0 KB -