oj.uz

Submission #654723

# Submission time Handle Problem Language Result Execution time Memory
654723 2022-11-01T11:05:10 Z Sam_a17 Rainforest Jumps (APIO21_jumps) C++14
44 / 100
 2442 ms 64164 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define dbg(x) cerr << #x << " " << x << endl;
#define ll long long

const int maxN = 2e5 + 10, LOG = 22, inf = 1e8;
int h[maxN], n, pre[maxN][LOG], nxt[maxN][LOG];
int mx[maxN][LOG];

struct segTree {
  vector<pair<long long, int>> mTree;
  int size;

  void init(long long n) {
    size = 1;
    while(size < n)  {
      size *= 2;
    }
    mTree.assign(2 * size - 1, {0, 0});
  }

  pair<ll, ll> combine(pair<ll, ll> a, pair<ll, ll> b) {
    if(a.first > b.first) {
      return a;
    } else {
      return b;
    }
  }

  void upd(int u, long long v, int x, int lx, int rx) { // set value at pos u
    if(rx - lx == 1) {
      mTree[x] = {v, lx};
      return;
    }

    int m = (lx + rx) / 2;
    if(u < m) {
      upd(u, v, 2 * x + 1, lx, m);
    }else {
      upd(u, v, 2 * x + 2, m, rx);
    }
    mTree[x] = combine(mTree[2 * x + 1], mTree[2 * x + 2]);
  }

  void upd(int u, long long v) {
    upd(u, v, 0, 0, size);
  }

  pair<ll, ll> qry (int l, int r, int x, int lx, int rx) { // range queries
    if(l >= rx || lx >= r) {
      return {INT64_MIN, -1};
    }
    if(lx >= l && r >= rx) {
      return mTree[x];
    }

    int m = (rx + lx) / 2;
    auto s1 = qry(l, r, 2 * x + 1, lx, m);
    auto s2 = qry(l, r, 2 * x + 2, m, rx);
    return combine(s1, s2);
  }

  pair<ll, ll> qry(int l, int r) {
    return qry(l, r, 0, 0, size);
  }
};

segTree seg;

void init(int N, std::vector<int> H) {
  n = N, seg.init(n + 1);
  for(int i = 0; i < N; i++) {
    h[i] = H[i];
    seg.upd(i, h[i]);
 
    //
    nxt[i][0] = pre[i][0] = i;
  }
 
  stack<pair<int, int>> st;
  for(int i = 0; i < N; i++) {
    while(!st.empty() && h[i] > st.top().first) {
      nxt[st.top().second][0] = i;
      st.pop();
    }
    st.push({h[i], i});
  }
 
  while(!st.empty()) st.pop();
 
  for(int i = N - 1; i >= 0; i--) {
    while(!st.empty() && h[i] > st.top().first) {
      pre[st.top().second][0] = i;
      st.pop();
    }
    st.push({h[i], i});
  }

  for(int i = 0; i < N; i++) {
    if(h[nxt[i][0]] >= h[pre[i][0]]) {
      mx[i][0] = nxt[i][0];
    } else {
      mx[i][0] = pre[i][0];
    }
  }

  for(int j = 1; j < LOG; j++) {
    for(int i = 0; i < N; i++) {
      mx[i][j] = mx[mx[i][j - 1]][j - 1];
      nxt[i][j] = nxt[nxt[i][j - 1]][j - 1];
      pre[i][j] = pre[pre[i][j - 1]][j - 1];
    }
  }
}
 
int get_mx(int mid, int node) {
  for(int i = 0; i < LOG; i++) {
    if(mid & (1 << i)) {
      node = mx[node][i];
    }
  }
  return node;
}

int get_r(int mid, int node) {
  for(int i = 0; i < LOG; i++) {
    if(mid & (1 << i)) {
      node = nxt[node][i];
    }
  }
  return node;
}

int minimum_jumps(int A, int B, int C, int D) {
  auto maxim = seg.qry(B, C);
  auto maxim_ = seg.qry(C, D + 1);
  if(maxim.first >= maxim_.first) {
    return -1;
  }

  int l = A, r = B, st = -1;
  while(l <= r) {
    int mid = (l + r) / 2;
    if(seg.qry(mid, r + 1).first < maxim_.first) {
      st = mid;
      r = mid - 1;
    } else {
      l = mid + 1;
    }
  }

  if(st == -1) {
    return -1;
  }

  A = seg.qry(st, B + 1).second;

  int ina = 0, inb = maxN, answ = 0;
  while(ina <= inb) {
    int mid = (ina + inb) / 2;
    int pos = get_mx(mid, A);
    if(h[pos] >= maxim.first) {
      answ = mid;
      inb = mid - 1;
    } else {
      ina = mid + 1;
    }
  }

  int pos = get_mx(answ, A);
  if(pos == D) return answ;
  if(h[pos] >= h[D]) { answ--; }

  pos = get_mx(answ, A);

  ina = 0, inb = maxN;
  int answ2 = 0;
  while(ina <= inb) {
    int mid = (ina + inb) / 2;
    int pos2 = get_r(mid, pos);
    if(h[pos2] >= h[D]) {
      answ2 = mid;
      inb = mid - 1;
    } else {
      ina = mid + 1;
    }
  }

  pos = get_r(answ2, pos);
  return answ2 + answ;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Incorrect 437 ms 52824 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Incorrect 115 ms 51880 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 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 286 ms 29044 KB Output is correct
5 Correct 1121 ms 62536 KB Output is correct
6 Correct 627 ms 11292 KB Output is correct
7 Correct 715 ms 62408 KB Output is correct
8 Correct 615 ms 23016 KB Output is correct
9 Correct 869 ms 62632 KB Output is correct
10 Correct 2098 ms 64060 KB Output is correct
11 Correct 1784 ms 63912 KB Output is correct
12 Correct 1608 ms 63816 KB Output is correct
13 Correct 961 ms 62504 KB Output is correct
14 Correct 1693 ms 63028 KB Output is correct
15 Correct 1088 ms 64072 KB Output is correct
16 Correct 673 ms 64144 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 17 ms 848 KB Output is correct
28 Correct 20 ms 848 KB Output is correct
29 Correct 17 ms 848 KB Output is correct
30 Correct 20 ms 848 KB Output is correct
31 Correct 18 ms 848 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 85 ms 35600 KB Output is correct
34 Correct 142 ms 62388 KB Output is correct
35 Correct 144 ms 63804 KB Output is correct
36 Correct 147 ms 62496 KB Output is correct
37 Correct 159 ms 63112 KB Output is correct
38 Correct 143 ms 64156 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 286 ms 29044 KB Output is correct
5 Correct 1121 ms 62536 KB Output is correct
6 Correct 627 ms 11292 KB Output is correct
7 Correct 715 ms 62408 KB Output is correct
8 Correct 615 ms 23016 KB Output is correct
9 Correct 869 ms 62632 KB Output is correct
10 Correct 2098 ms 64060 KB Output is correct
11 Correct 1784 ms 63912 KB Output is correct
12 Correct 1608 ms 63816 KB Output is correct
13 Correct 961 ms 62504 KB Output is correct
14 Correct 1693 ms 63028 KB Output is correct
15 Correct 1088 ms 64072 KB Output is correct
16 Correct 673 ms 64144 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 17 ms 848 KB Output is correct
28 Correct 20 ms 848 KB Output is correct
29 Correct 17 ms 848 KB Output is correct
30 Correct 20 ms 848 KB Output is correct
31 Correct 18 ms 848 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 85 ms 35600 KB Output is correct
34 Correct 142 ms 62388 KB Output is correct
35 Correct 144 ms 63804 KB Output is correct
36 Correct 147 ms 62496 KB Output is correct
37 Correct 159 ms 63112 KB Output is correct
38 Correct 143 ms 64156 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 269 ms 29000 KB Output is correct
43 Correct 1082 ms 62504 KB Output is correct
44 Correct 692 ms 11216 KB Output is correct
45 Correct 1066 ms 62408 KB Output is correct
46 Correct 602 ms 22952 KB Output is correct
47 Correct 1041 ms 62636 KB Output is correct
48 Correct 2124 ms 64060 KB Output is correct
49 Correct 1397 ms 63944 KB Output is correct
50 Correct 1884 ms 63944 KB Output is correct
51 Correct 1102 ms 62500 KB Output is correct
52 Correct 1724 ms 63004 KB Output is correct
53 Correct 1016 ms 64072 KB Output is correct
54 Correct 1073 ms 64160 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Correct 199 ms 62244 KB Output is correct
57 Correct 998 ms 62512 KB Output is correct
58 Correct 549 ms 11848 KB Output is correct
59 Correct 717 ms 62516 KB Output is correct
60 Correct 413 ms 23504 KB Output is correct
61 Correct 1060 ms 62540 KB Output is correct
62 Correct 2442 ms 64072 KB Output is correct
63 Correct 1876 ms 63796 KB Output is correct
64 Correct 1703 ms 63652 KB Output is correct
65 Correct 1078 ms 62516 KB Output is correct
66 Correct 1909 ms 63112 KB Output is correct
67 Correct 1274 ms 64164 KB Output is correct
68 Correct 1087 ms 64072 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 3 ms 336 KB Output is correct
72 Correct 3 ms 336 KB Output is correct
73 Correct 2 ms 336 KB Output is correct
74 Correct 3 ms 336 KB Output is correct
75 Correct 3 ms 336 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 1 ms 208 KB Output is correct
78 Correct 2 ms 208 KB Output is correct
79 Correct 2 ms 336 KB Output is correct
80 Correct 3 ms 336 KB Output is correct
81 Correct 2 ms 336 KB Output is correct
82 Correct 2 ms 336 KB Output is correct
83 Correct 3 ms 336 KB Output is correct
84 Correct 1 ms 336 KB Output is correct
85 Correct 3 ms 336 KB Output is correct
86 Correct 18 ms 848 KB Output is correct
87 Correct 25 ms 848 KB Output is correct
88 Correct 20 ms 848 KB Output is correct
89 Correct 24 ms 848 KB Output is correct
90 Correct 21 ms 848 KB Output is correct
91 Correct 0 ms 336 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 21 ms 848 KB Output is correct
94 Correct 22 ms 848 KB Output is correct
95 Correct 15 ms 848 KB Output is correct
96 Correct 17 ms 796 KB Output is correct
97 Correct 22 ms 848 KB Output is correct
98 Correct 0 ms 208 KB Output is correct
99 Correct 141 ms 62384 KB Output is correct
100 Correct 142 ms 62500 KB Output is correct
101 Correct 136 ms 63656 KB Output is correct
102 Correct 162 ms 62628 KB Output is correct
103 Correct 151 ms 63044 KB Output is correct
104 Correct 147 ms 64072 KB Output is correct
105 Correct 0 ms 208 KB Output is correct
106 Correct 81 ms 35656 KB Output is correct
107 Correct 145 ms 62580 KB Output is correct
108 Correct 134 ms 63780 KB Output is correct
109 Correct 150 ms 62412 KB Output is correct
110 Correct 179 ms 63064 KB Output is correct
111 Correct 132 ms 64160 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Incorrect 437 ms 52824 KB Output isn't correct
4 Halted 0 ms 0 KB -