oj.uz

Submission #964621

# Submission time Handle Problem Language Result Execution time Memory
964621 2024-04-17T08:22:15 Z kilkuwu Rainforest Jumps (APIO21_jumps) C++17
27 / 100
 956 ms 105720 KB 
#include "jumps.h"

#include <bits/stdc++.h>

template <typename Info, typename Merge = std::plus<Info>>
struct IterativeSegmentTree {
  int n;
  std::vector<Info> T;

  IterativeSegmentTree() {}

  IterativeSegmentTree(int _n) : n(2 << std::__lg(_n)), T(2 * n, Info()){};

  template <typename Type>
  IterativeSegmentTree(const std::vector<Type>& a) : n(2 << std::__lg(a.size())), T(2 * n, Info()) {
    for (int i = n; i < n + (int) a.size(); i++) {
      T[i] = a[i - n];
    }
    for (int i = n - 1; i > 0; i--) {
      T[i] = Merge()(T[i << 1], T[i << 1 | 1]);
    }
  }

  template <typename Iterator>
  IterativeSegmentTree(Iterator first, Iterator last) : n(2 << std::__lg(distance(first, last))), T(2 * n, Info()) {
    int id = n;
    for (Iterator it = first; it != last; it++) {
      T[id++] = *it;
    }
    for (int i = n - 1; i > 0; i--) {
      T[i] = Merge()(T[i << 1], T[i << 1 | 1]);
    }
  }

  void update(int p, const Info& v) {
    for (T[p += n] = v; p >>= 1;) {
      T[p] = Merge()(T[p << 1], T[p << 1 | 1]);
    }
  }

  Info query(int l, int r) {
    Info resl = Info(), resr = Info();
    for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
      if (l & 1) resl = Merge()(resl, T[l++]);
      if (r & 1) resr = Merge()(T[--r], resr);
    }
    return Merge()(resl, resr);
  }
};

struct Info {
  std::pair<int, int> mn = {1e9, -1}, mx = {-1e9, -1};
};

Info operator+(const Info& a, const Info& b) {
  return {std::min(a.mn, b.mn), std::max(a.mx, b.mx)};
}

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;

IterativeSegmentTree<Info> tree;

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);
  }

  tree = IterativeSegmentTree<Info>(N);
  for (int i = 0; i < N; i++) {
    tree.update(i, {{H[i], i}, {H[i], i}});
  }

  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 bl = tree.query(A, B + 1);
  auto br = tree.query(C, D + 1);
  if (sz_mid > 0) {
    auto bmid = tree.query(B + 1, C);

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

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

  int jumps = 0;
  int u = B;
  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;
}

Compilation message

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:134:8: warning: variable 'bl' set but not used [-Wunused-but-set-variable]
  134 |   auto bl = tree.query(A, B + 1);
      |        ^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 55888 KB Output is correct
2 Correct 7 ms 51800 KB Output is correct
3 Correct 152 ms 95476 KB Output is correct
4 Correct 952 ms 105656 KB Output is correct
5 Correct 805 ms 79276 KB Output is correct
6 Correct 956 ms 105552 KB Output is correct
7 Correct 715 ms 90872 KB Output is correct
8 Correct 920 ms 105516 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 53848 KB Output is correct
2 Correct 5 ms 47704 KB Output is correct
3 Correct 6 ms 47704 KB Output is correct
4 Correct 5 ms 45656 KB Output is correct
5 Incorrect 6 ms 43864 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 53848 KB Output is correct
2 Correct 5 ms 47704 KB Output is correct
3 Correct 6 ms 47704 KB Output is correct
4 Correct 5 ms 45656 KB Output is correct
5 Incorrect 6 ms 43864 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 45800 KB Output is correct
2 Correct 6 ms 45656 KB Output is correct
3 Correct 5 ms 45656 KB Output is correct
4 Correct 6 ms 47832 KB Output is correct
5 Incorrect 62 ms 93984 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 47704 KB Output is correct
2 Correct 5 ms 43864 KB Output is correct
3 Correct 5 ms 41816 KB Output is correct
4 Correct 184 ms 69632 KB Output is correct
5 Correct 722 ms 104848 KB Output is correct
6 Correct 459 ms 54360 KB Output is correct
7 Correct 690 ms 104884 KB Output is correct
8 Correct 410 ms 64700 KB Output is correct
9 Correct 724 ms 104708 KB Output is correct
10 Correct 900 ms 105720 KB Output is correct
11 Correct 854 ms 105664 KB Output is correct
12 Correct 862 ms 105396 KB Output is correct
13 Correct 710 ms 104888 KB Output is correct
14 Correct 850 ms 105092 KB Output is correct
15 Correct 696 ms 105660 KB Output is correct
16 Correct 702 ms 105532 KB Output is correct
17 Correct 5 ms 39768 KB Output is correct
18 Correct 5 ms 39768 KB Output is correct
19 Correct 5 ms 37720 KB Output is correct
20 Correct 6 ms 39768 KB Output is correct
21 Correct 5 ms 37720 KB Output is correct
22 Correct 5 ms 37720 KB Output is correct
23 Correct 5 ms 37720 KB Output is correct
24 Correct 5 ms 37720 KB Output is correct
25 Correct 5 ms 37720 KB Output is correct
26 Correct 5 ms 37976 KB Output is correct
27 Correct 14 ms 38424 KB Output is correct
28 Correct 14 ms 38488 KB Output is correct
29 Correct 14 ms 38420 KB Output is correct
30 Correct 18 ms 38428 KB Output is correct
31 Correct 17 ms 40428 KB Output is correct
32 Correct 5 ms 37720 KB Output is correct
33 Correct 57 ms 75128 KB Output is correct
34 Correct 76 ms 104688 KB Output is correct
35 Correct 76 ms 105420 KB Output is correct
36 Correct 93 ms 104888 KB Output is correct
37 Correct 78 ms 105104 KB Output is correct
38 Correct 83 ms 105532 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 47704 KB Output is correct
2 Correct 5 ms 43864 KB Output is correct
3 Correct 5 ms 41816 KB Output is correct
4 Correct 184 ms 69632 KB Output is correct
5 Correct 722 ms 104848 KB Output is correct
6 Correct 459 ms 54360 KB Output is correct
7 Correct 690 ms 104884 KB Output is correct
8 Correct 410 ms 64700 KB Output is correct
9 Correct 724 ms 104708 KB Output is correct
10 Correct 900 ms 105720 KB Output is correct
11 Correct 854 ms 105664 KB Output is correct
12 Correct 862 ms 105396 KB Output is correct
13 Correct 710 ms 104888 KB Output is correct
14 Correct 850 ms 105092 KB Output is correct
15 Correct 696 ms 105660 KB Output is correct
16 Correct 702 ms 105532 KB Output is correct
17 Correct 5 ms 39768 KB Output is correct
18 Correct 5 ms 39768 KB Output is correct
19 Correct 5 ms 37720 KB Output is correct
20 Correct 6 ms 39768 KB Output is correct
21 Correct 5 ms 37720 KB Output is correct
22 Correct 5 ms 37720 KB Output is correct
23 Correct 5 ms 37720 KB Output is correct
24 Correct 5 ms 37720 KB Output is correct
25 Correct 5 ms 37720 KB Output is correct
26 Correct 5 ms 37976 KB Output is correct
27 Correct 14 ms 38424 KB Output is correct
28 Correct 14 ms 38488 KB Output is correct
29 Correct 14 ms 38420 KB Output is correct
30 Correct 18 ms 38428 KB Output is correct
31 Correct 17 ms 40428 KB Output is correct
32 Correct 5 ms 37720 KB Output is correct
33 Correct 57 ms 75128 KB Output is correct
34 Correct 76 ms 104688 KB Output is correct
35 Correct 76 ms 105420 KB Output is correct
36 Correct 93 ms 104888 KB Output is correct
37 Correct 78 ms 105104 KB Output is correct
38 Correct 83 ms 105532 KB Output is correct
39 Correct 5 ms 39768 KB Output is correct
40 Correct 4 ms 37720 KB Output is correct
41 Correct 4 ms 37720 KB Output is correct
42 Correct 192 ms 67560 KB Output is correct
43 Correct 720 ms 104780 KB Output is correct
44 Correct 454 ms 54340 KB Output is correct
45 Correct 706 ms 104916 KB Output is correct
46 Correct 408 ms 64724 KB Output is correct
47 Correct 713 ms 104720 KB Output is correct
48 Correct 890 ms 105528 KB Output is correct
49 Correct 861 ms 105656 KB Output is correct
50 Correct 881 ms 105432 KB Output is correct
51 Correct 698 ms 104712 KB Output is correct
52 Correct 843 ms 105100 KB Output is correct
53 Correct 718 ms 105532 KB Output is correct
54 Correct 678 ms 105652 KB Output is correct
55 Correct 7 ms 59992 KB Output is correct
56 Incorrect 115 ms 104696 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 55888 KB Output is correct
2 Correct 7 ms 51800 KB Output is correct
3 Correct 152 ms 95476 KB Output is correct
4 Correct 952 ms 105656 KB Output is correct
5 Correct 805 ms 79276 KB Output is correct
6 Correct 956 ms 105552 KB Output is correct
7 Correct 715 ms 90872 KB Output is correct
8 Correct 920 ms 105516 KB Output is correct
9 Correct 6 ms 53848 KB Output is correct
10 Correct 5 ms 47704 KB Output is correct
11 Correct 6 ms 47704 KB Output is correct
12 Correct 5 ms 45656 KB Output is correct
13 Incorrect 6 ms 43864 KB Output isn't correct
14 Halted 0 ms 0 KB -