oj.uz

Submission #964639

# Submission time Handle Problem Language Result Execution time Memory
964639 2024-04-17T08:52:00 Z kilkuwu Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 959 ms 127316 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 = 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;

  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;
    if (to >= f) continue; // we don't want it to go past this one 
    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;
}

Compilation message

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

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 92752 KB Output is correct
2 Correct 12 ms 92760 KB Output is correct
3 Correct 133 ms 120028 KB Output is correct
4 Correct 932 ms 127088 KB Output is correct
5 Correct 802 ms 109272 KB Output is correct
6 Correct 959 ms 127312 KB Output is correct
7 Correct 718 ms 116384 KB Output is correct
8 Correct 955 ms 127144 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 14 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 10 ms 92760 KB Output is correct
5 Correct 11 ms 92760 KB Output is correct
6 Incorrect 11 ms 92760 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 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 10 ms 92760 KB Output is correct
5 Correct 11 ms 92760 KB Output is correct
6 Incorrect 11 ms 92760 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 12.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 92696 KB Output is correct
4 Correct 11 ms 92760 KB Output is correct
5 Correct 58 ms 119724 KB Output is correct
6 Correct 65 ms 126276 KB Output is correct
7 Correct 36 ms 109048 KB Output is correct
8 Correct 71 ms 126276 KB Output is correct
9 Correct 18 ms 97132 KB Output is correct
10 Correct 78 ms 126344 KB Output is correct
11 Correct 56 ms 127148 KB Output is correct
12 Correct 58 ms 126872 KB Output is correct
13 Correct 58 ms 126916 KB Output is correct
14 Correct 70 ms 126280 KB Output is correct
15 Incorrect 59 ms 126824 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 10 ms 92760 KB Output is correct
2 Correct 10 ms 92760 KB Output is correct
3 Correct 6 ms 92760 KB Output is correct
4 Correct 166 ms 107440 KB Output is correct
5 Correct 634 ms 126312 KB Output is correct
6 Correct 408 ms 97620 KB Output is correct
7 Correct 632 ms 126296 KB Output is correct
8 Correct 378 ms 103720 KB Output is correct
9 Correct 648 ms 126384 KB Output is correct
10 Correct 849 ms 127244 KB Output is correct
11 Correct 826 ms 127004 KB Output is correct
12 Correct 823 ms 127132 KB Output is correct
13 Correct 642 ms 126324 KB Output is correct
14 Correct 797 ms 126680 KB Output is correct
15 Correct 611 ms 127136 KB Output is correct
16 Correct 634 ms 127140 KB Output is correct
17 Correct 10 ms 92760 KB Output is correct
18 Correct 10 ms 92688 KB Output is correct
19 Correct 10 ms 92760 KB Output is correct
20 Correct 11 ms 92760 KB Output is correct
21 Correct 12 ms 92772 KB Output is correct
22 Correct 12 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 11 ms 92768 KB Output is correct
26 Correct 10 ms 92876 KB Output is correct
27 Correct 20 ms 93028 KB Output is correct
28 Correct 22 ms 93036 KB Output is correct
29 Correct 17 ms 93016 KB Output is correct
30 Correct 20 ms 93004 KB Output is correct
31 Correct 22 ms 93008 KB Output is correct
32 Correct 11 ms 92760 KB Output is correct
33 Correct 41 ms 111280 KB Output is correct
34 Correct 62 ms 126380 KB Output is correct
35 Correct 60 ms 127148 KB Output is correct
36 Correct 64 ms 126340 KB Output is correct
37 Correct 64 ms 126828 KB Output is correct
38 Correct 60 ms 127116 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 6 ms 92760 KB Output is correct
4 Correct 166 ms 107440 KB Output is correct
5 Correct 634 ms 126312 KB Output is correct
6 Correct 408 ms 97620 KB Output is correct
7 Correct 632 ms 126296 KB Output is correct
8 Correct 378 ms 103720 KB Output is correct
9 Correct 648 ms 126384 KB Output is correct
10 Correct 849 ms 127244 KB Output is correct
11 Correct 826 ms 127004 KB Output is correct
12 Correct 823 ms 127132 KB Output is correct
13 Correct 642 ms 126324 KB Output is correct
14 Correct 797 ms 126680 KB Output is correct
15 Correct 611 ms 127136 KB Output is correct
16 Correct 634 ms 127140 KB Output is correct
17 Correct 10 ms 92760 KB Output is correct
18 Correct 10 ms 92688 KB Output is correct
19 Correct 10 ms 92760 KB Output is correct
20 Correct 11 ms 92760 KB Output is correct
21 Correct 12 ms 92772 KB Output is correct
22 Correct 12 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 11 ms 92768 KB Output is correct
26 Correct 10 ms 92876 KB Output is correct
27 Correct 20 ms 93028 KB Output is correct
28 Correct 22 ms 93036 KB Output is correct
29 Correct 17 ms 93016 KB Output is correct
30 Correct 20 ms 93004 KB Output is correct
31 Correct 22 ms 93008 KB Output is correct
32 Correct 11 ms 92760 KB Output is correct
33 Correct 41 ms 111280 KB Output is correct
34 Correct 62 ms 126380 KB Output is correct
35 Correct 60 ms 127148 KB Output is correct
36 Correct 64 ms 126340 KB Output is correct
37 Correct 64 ms 126828 KB Output is correct
38 Correct 60 ms 127116 KB Output is correct
39 Correct 12 ms 92760 KB Output is correct
40 Correct 10 ms 92760 KB Output is correct
41 Correct 11 ms 92760 KB Output is correct
42 Correct 156 ms 107340 KB Output is correct
43 Correct 626 ms 126288 KB Output is correct
44 Correct 416 ms 97620 KB Output is correct
45 Correct 628 ms 126420 KB Output is correct
46 Correct 381 ms 103792 KB Output is correct
47 Correct 634 ms 126364 KB Output is correct
48 Correct 873 ms 127128 KB Output is correct
49 Correct 832 ms 127316 KB Output is correct
50 Correct 823 ms 127084 KB Output is correct
51 Correct 619 ms 126436 KB Output is correct
52 Correct 784 ms 126832 KB Output is correct
53 Correct 671 ms 127176 KB Output is correct
54 Correct 649 ms 127124 KB Output is correct
55 Correct 10 ms 92764 KB Output is correct
56 Correct 93 ms 126236 KB Output is correct
57 Correct 631 ms 126380 KB Output is correct
58 Correct 335 ms 97984 KB Output is correct
59 Correct 611 ms 126372 KB Output is correct
60 Correct 270 ms 104228 KB Output is correct
61 Correct 613 ms 126424 KB Output is correct
62 Correct 891 ms 127096 KB Output is correct
63 Correct 837 ms 126912 KB Output is correct
64 Correct 810 ms 126792 KB Output is correct
65 Correct 625 ms 126244 KB Output is correct
66 Correct 813 ms 126828 KB Output is correct
67 Correct 690 ms 127104 KB Output is correct
68 Correct 616 ms 127272 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 92732 KB Output is correct
73 Correct 11 ms 92760 KB Output is correct
74 Correct 13 ms 92728 KB Output is correct
75 Correct 11 ms 92712 KB Output is correct
76 Correct 10 ms 92760 KB Output is correct
77 Correct 8 ms 92760 KB Output is correct
78 Correct 12 ms 92760 KB Output is correct
79 Correct 11 ms 92760 KB Output is correct
80 Correct 10 ms 92760 KB Output is correct
81 Correct 11 ms 92740 KB Output is correct
82 Correct 11 ms 92760 KB Output is correct
83 Correct 15 ms 92924 KB Output is correct
84 Correct 10 ms 92760 KB Output is correct
85 Correct 13 ms 92760 KB Output is correct
86 Correct 17 ms 93016 KB Output is correct
87 Correct 23 ms 93016 KB Output is correct
88 Correct 20 ms 93016 KB Output is correct
89 Correct 23 ms 93024 KB Output is correct
90 Correct 21 ms 93016 KB Output is correct
91 Correct 11 ms 92760 KB Output is correct
92 Correct 11 ms 92872 KB Output is correct
93 Correct 21 ms 93016 KB Output is correct
94 Correct 21 ms 93024 KB Output is correct
95 Correct 22 ms 93012 KB Output is correct
96 Correct 19 ms 93264 KB Output is correct
97 Correct 20 ms 93016 KB Output is correct
98 Correct 10 ms 92760 KB Output is correct
99 Correct 70 ms 126252 KB Output is correct
100 Correct 81 ms 126372 KB Output is correct
101 Correct 69 ms 126980 KB Output is correct
102 Correct 65 ms 126364 KB Output is correct
103 Correct 57 ms 126740 KB Output is correct
104 Correct 60 ms 127248 KB Output is correct
105 Correct 10 ms 92760 KB Output is correct
106 Correct 43 ms 111352 KB Output is correct
107 Correct 68 ms 126368 KB Output is correct
108 Correct 70 ms 126976 KB Output is correct
109 Correct 62 ms 126476 KB Output is correct
110 Correct 61 ms 126828 KB Output is correct
111 Correct 63 ms 127088 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 92752 KB Output is correct
2 Correct 12 ms 92760 KB Output is correct
3 Correct 133 ms 120028 KB Output is correct
4 Correct 932 ms 127088 KB Output is correct
5 Correct 802 ms 109272 KB Output is correct
6 Correct 959 ms 127312 KB Output is correct
7 Correct 718 ms 116384 KB Output is correct
8 Correct 955 ms 127144 KB Output is correct
9 Correct 14 ms 92760 KB Output is correct
10 Correct 10 ms 92760 KB Output is correct
11 Correct 10 ms 92760 KB Output is correct
12 Correct 10 ms 92760 KB Output is correct
13 Correct 11 ms 92760 KB Output is correct
14 Incorrect 11 ms 92760 KB Output isn't correct
15 Halted 0 ms 0 KB -