oj.uz

Submission #964611

# Submission time Handle Problem Language Result Execution time Memory
964611 2024-04-17T08:05:11 Z kilkuwu Rainforest Jumps (APIO21_jumps) C++17
33 / 100
 4000 ms 13500 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;
int L[mxN];
int R[mxN];
int N;

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[i] = st.empty() ? -1 : st.top();
    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[i] = st.empty() ? -1 : st.top();
    st.push(i);
  }

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

// we answer them in O(n)
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;

  std::vector<int> dp(N, -1);
  std::queue<int> q;
  for (int i = A; i <= B; i++) {
    dp[i] = 0;
    q.push(i);
  }

  while (q.size()) {
    int u = q.front();
    q.pop();

    for (int v : {L[u], R[u]}) {
      if (v == -1) continue;
      if (dp[v] != -1) continue;
      dp[v] = dp[u] + 1;
      q.emplace(v);
    }
  }

  int ans = 1e9;
  for (int i = C; i <= D; i++) {
    if (dp[i] != -1) ans = std::min(ans, dp[i]);
  }
  return ans;
}

Compilation message

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

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 4082 ms 12416 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 344 KB Output is correct
29 Correct 2 ms 544 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 432 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 344 KB Output is correct
29 Correct 2 ms 544 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 432 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 1 ms 500 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 2 ms 344 KB Output is correct
50 Correct 2 ms 504 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 2 ms 344 KB Output is correct
54 Correct 2 ms 432 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 13 ms 344 KB Output is correct
59 Correct 16 ms 552 KB Output is correct
60 Correct 4 ms 344 KB Output is correct
61 Correct 15 ms 800 KB Output is correct
62 Correct 9 ms 344 KB Output is correct
63 Correct 17 ms 600 KB Output is correct
64 Correct 34 ms 596 KB Output is correct
65 Correct 38 ms 540 KB Output is correct
66 Correct 28 ms 540 KB Output is correct
67 Correct 14 ms 560 KB Output is correct
68 Correct 30 ms 344 KB Output is correct
69 Correct 28 ms 540 KB Output is correct
70 Correct 25 ms 564 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 344 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 2 ms 344 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 1 ms 508 KB Output is correct
82 Correct 2 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 1 ms 600 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 1 ms 344 KB Output is correct
92 Correct 1 ms 344 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 2 ms 596 KB Output is correct
95 Correct 12 ms 344 KB Output is correct
96 Correct 24 ms 536 KB Output is correct
97 Correct 11 ms 600 KB Output is correct
98 Correct 24 ms 600 KB Output is correct
99 Correct 15 ms 600 KB Output is correct
100 Correct 0 ms 344 KB Output is correct
101 Correct 1 ms 344 KB Output is correct
102 Correct 10 ms 552 KB Output is correct
103 Correct 23 ms 552 KB Output is correct
104 Correct 9 ms 600 KB Output is correct
105 Correct 21 ms 544 KB Output is correct
106 Correct 19 ms 600 KB Output is correct
107 Correct 1 ms 344 KB Output is correct
108 Correct 1 ms 344 KB Output is correct
109 Correct 1 ms 556 KB Output is correct
110 Correct 1 ms 344 KB Output is correct
111 Correct 1 ms 496 KB Output is correct
112 Correct 1 ms 344 KB Output is correct
113 Correct 1 ms 344 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 356 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 42 ms 11932 KB Output is correct
6 Correct 51 ms 12632 KB Output is correct
7 Correct 20 ms 6476 KB Output is correct
8 Correct 43 ms 13224 KB Output is correct
9 Correct 7 ms 2136 KB Output is correct
10 Correct 41 ms 12640 KB Output is correct
11 Correct 55 ms 13380 KB Output is correct
12 Correct 45 ms 13144 KB Output is correct
13 Correct 44 ms 13192 KB Output is correct
14 Correct 41 ms 12576 KB Output is correct
15 Correct 51 ms 12916 KB Output is correct
16 Correct 47 ms 13312 KB Output is correct
17 Correct 49 ms 13228 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 356 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 40 ms 12536 KB Output is correct
34 Correct 45 ms 12556 KB Output is correct
35 Correct 54 ms 13184 KB Output is correct
36 Correct 42 ms 12572 KB Output is correct
37 Correct 55 ms 12676 KB Output is correct
38 Correct 45 ms 13396 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 27 ms 6708 KB Output is correct
41 Correct 44 ms 12548 KB Output is correct
42 Correct 49 ms 13500 KB Output is correct
43 Correct 39 ms 12372 KB Output is correct
44 Correct 43 ms 12680 KB Output is correct
45 Correct 41 ms 13400 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 159 ms 6248 KB Output is correct
5 Correct 658 ms 12548 KB Output is correct
6 Correct 437 ms 3284 KB Output is correct
7 Correct 637 ms 12792 KB Output is correct
8 Correct 352 ms 5912 KB Output is correct
9 Correct 634 ms 12568 KB Output is correct
10 Execution timed out 4067 ms 13500 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 159 ms 6248 KB Output is correct
5 Correct 658 ms 12548 KB Output is correct
6 Correct 437 ms 3284 KB Output is correct
7 Correct 637 ms 12792 KB Output is correct
8 Correct 352 ms 5912 KB Output is correct
9 Correct 634 ms 12568 KB Output is correct
10 Execution timed out 4067 ms 13500 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 4082 ms 12416 KB Time limit exceeded
4 Halted 0 ms 0 KB -