oj.uz

Submission #980327

# Submission time Handle Problem Language Result Execution time Memory
980327 2024-05-12T05:05:24 Z Tsagana Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 783 ms 49012 KB 
#include "jumps.h"

//OP
#include<bits/stdc++.h>
 
#define all(x) x.begin(), x.end()
#define pi pair<int, int >
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define mset multiset
#define F first
#define S second
#define meta int M = (L + R) / 2, x = 2 * id + 1, y = x + 1
 
using namespace std;
 
bool one;
 
struct tree {
  int n;
  int lj[200005];
  int rj[200005];
  int J[200005][20];
  int J2[200005][20];
  vector<int> h;
  pi t[800005];
  pi g[800005];
 
  void build(int id, int L, int R) {
    if (L == R) {t[id] = {h[L], L}; g[id] = {h[L], L}; return ;}
    meta;
    build(x, L, M);
    build(y, M + 1, R);
    t[id] = max(t[x], t[y]);
    g[id] = min(g[x], g[y]);
  } void build() {build(0, 0, n-1); return ;}
 
  pi query(int id, int L, int R, int l, int r) {
    if (R <  l || r <  L) return {-2e9, -1};
    if (l <= L && r >= R) return t[id];
    meta;
    return max(query(x, L, M, l, r), query(y, M + 1, R, l, r));
  } pi query(int L, int R) {return query(0, 0, n-1, L, R);}

  pi ub(int id, int L, int R, int i, int k) {
    if (t[id].F < k) return {-2e9, -1};
    if (L == R) return t[id];
    meta;
    if (i <= M) return ub(x, L, M, i, k);
    if (i <  R) {
      pi ans = ub(y, M + 1, R, i, k);
      if (ans.S != -1) return ans;
      return ub(x, L, M, M, k);
    }
    if (t[y].F > k) return ub(y, M + 1, R, i, k);
    return ub(x, L, M, M, k);
  } pi ub(int R, int k) {return ub(0, 0, n-1, R, k);}

  pi lb(int id, int L, int R, int l, int r, int k) {
    if (g[id].F > k) return {-2e9, -1};
    if (L == R) return t[id];
    meta;
    if (r <= M) return lb(x, L, M, l, r, k);
    if (l >  M) return lb(y, M + 1, R, l, r, k);

    if (g[y].F > k) return lb(x, L, M, l, M, k);
    if (g[x].F > k) return lb(y, M + 1, R, M + 1, r, k);
    return max(lb(x, L, M, l, M, k), lb(y, M + 1, R, M + 1, r, k));
  } pi lb(int L, int R, int k) {return lb(0, 0, n-1, L, R, k);}
 
  void take_J(vector<int> H) {
    stack<int> st;
    for (int i = 0; i < n; i++) {
      while (!st.empty() && H[st.top()] < H[i]) st.pop();
      if (st.empty()) lj[i] = -1;
      else lj[i] = st.top();
      st.push(i);
    }
 
    while (!st.empty()) st.pop();
    for (int i = n-1; i >= 0; i--) {
      while (!st.empty() && H[st.top()] < H[i]) st.pop();
      if (st.empty()) rj[i] = n;
      else rj[i] = st.top();
      st.push(i);
    }
  }
 
  void set_J() {
    for (int i = 0; i < n; i++) {
      int mx = lj[i], mx2 = rj[i];
 
      if (mx == -1) mx = n;
      if (h[mx] < h[mx2]) swap(mx, mx2);
 
      J[i][0] = mx;
      J2[i][0] = mx2;
    }
 
    J[n][0] = J2[n][0] = n;
 
    for (int j = 1; j < 20; j++)
    for (int i = 0; i <= n; i++)
      J[i][j] = J[J[i][j-1]][j-1];
 
    for (int j = 1; j < 20; j++)
    for (int i = 0; i <= n; i++)
      J2[i][j] = J2[J2[i][j-1]][j-1];
  }
 
  int count(int A, int B, int C) {
    A = query(max(A, lj[C] + 1), B).S;
    if (A == -1) return -1;
    
    int ans = 0;
    
    for (int i = 19; i >= 0; i--)
    if (h[J[A][i]] < h[C]) {A = J[A][i]; ans += (1 << i);}
    if (J[A][0] == C) return ans + 1;
 
    for (int i = 19; i >= 0; i--)
    if (h[J2[A][i]] < h[C]) {A = J2[A][i]; ans += (1 << i);}
    if (J2[A][0] == C) return ans + 1;
    
    return -1;
  }

  int rount(int C, int A, int B) {
    A = query(A, min(rj[C] - 1, B)).S;
    if (A == -1) return -1;
    
    int ans = 0;
 
    for (int i = 19; i >= 0; i--)
    if (h[J[A][i]] < h[C]) {A = J[A][i]; ans += (1 << i);}
    if (J[A][0] == C) return ans + 1;
 
    for (int i = 19; i >= 0; i--)
    if (h[J2[A][i]] < h[C]) {A = J2[A][i]; ans += (1 << i);}
    if (J2[A][0] == C) return ans + 1;
    
    return -1;
  }
 
  int count(int A, int B, int C, int D) {
    if (B + 1 == C) {
      if (query(C, D).F < h[B]) return -1;
      return 1;
    }

    pi mx = query(C, D);
    // a, b, c, d
    pi b = query(A, B);
    pi c = query(B+1, C-1);
    
    if (ub(C-1, mx.F).S >= B) return -1;
    if (b > c && b < mx) return 1;
    if (lb(A, B, mx.F).S == -1) return -1;

    int ans = count(A, B, c.S);
    if (ans != -1) ans++;

    pi a = ub(A-1, c.F);
    if (a.S != -1 && a.F < mx.F) {
      int x = rount(a.S, A, B);
      if (x != -1) ans = min(ans, x + 1);
    }
    return ans;
  }
} T;
 
void init(int N, std::vector<int> H) {
  T.n = N; T.h = H;
  T.take_J(H);
  T.build();
  T.h.pb(N + 1);
  T.set_J();
 
  one = 1;
  for (int i = 0; i < N; i++) if (H[i] != i+1) {one = 0; break;}
}
 
int minimum_jumps(int A, int B, int C, int D) {
  if (C == D) return T.count(A, B, C);
  if (one) return C-B;
  return T.count(A, B, C, D);
}
//ED

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18776 KB Output is correct
2 Correct 3 ms 18776 KB Output is correct
3 Correct 83 ms 45764 KB Output is correct
4 Correct 596 ms 48260 KB Output is correct
5 Correct 517 ms 36772 KB Output is correct
6 Correct 655 ms 48324 KB Output is correct
7 Correct 456 ms 41336 KB Output is correct
8 Correct 623 ms 48272 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18776 KB Output is correct
2 Correct 2 ms 18776 KB Output is correct
3 Correct 2 ms 18776 KB Output is correct
4 Correct 2 ms 18776 KB Output is correct
5 Correct 41 ms 45508 KB Output is correct
6 Correct 53 ms 47936 KB Output is correct
7 Correct 22 ms 36664 KB Output is correct
8 Correct 64 ms 48176 KB Output is correct
9 Correct 8 ms 23640 KB Output is correct
10 Correct 57 ms 48128 KB Output is correct
11 Correct 51 ms 48264 KB Output is correct
12 Correct 48 ms 48328 KB Output is correct
13 Correct 46 ms 48220 KB Output is correct
14 Correct 54 ms 48176 KB Output is correct
15 Correct 53 ms 48368 KB Output is correct
16 Incorrect 48 ms 48812 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18776 KB Output is correct
2 Correct 3 ms 18776 KB Output is correct
3 Correct 3 ms 18776 KB Output is correct
4 Correct 152 ms 34776 KB Output is correct
5 Correct 596 ms 48184 KB Output is correct
6 Correct 418 ms 23632 KB Output is correct
7 Correct 642 ms 48180 KB Output is correct
8 Correct 348 ms 30008 KB Output is correct
9 Correct 650 ms 48184 KB Output is correct
10 Correct 726 ms 48272 KB Output is correct
11 Correct 783 ms 48332 KB Output is correct
12 Correct 743 ms 48120 KB Output is correct
13 Correct 590 ms 48188 KB Output is correct
14 Correct 714 ms 48536 KB Output is correct
15 Correct 606 ms 48952 KB Output is correct
16 Correct 593 ms 48944 KB Output is correct
17 Correct 3 ms 18776 KB Output is correct
18 Correct 2 ms 18776 KB Output is correct
19 Correct 3 ms 18776 KB Output is correct
20 Correct 4 ms 18776 KB Output is correct
21 Correct 4 ms 18776 KB Output is correct
22 Correct 3 ms 18776 KB Output is correct
23 Correct 3 ms 18888 KB Output is correct
24 Correct 3 ms 19028 KB Output is correct
25 Correct 2 ms 18880 KB Output is correct
26 Correct 3 ms 18776 KB Output is correct
27 Correct 15 ms 19056 KB Output is correct
28 Correct 15 ms 19032 KB Output is correct
29 Correct 16 ms 19032 KB Output is correct
30 Correct 13 ms 19032 KB Output is correct
31 Correct 10 ms 19032 KB Output is correct
32 Correct 3 ms 18776 KB Output is correct
33 Correct 26 ms 38856 KB Output is correct
34 Correct 56 ms 48204 KB Output is correct
35 Correct 47 ms 48324 KB Output is correct
36 Correct 70 ms 48364 KB Output is correct
37 Correct 59 ms 48524 KB Output is correct
38 Correct 45 ms 48952 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18776 KB Output is correct
2 Correct 3 ms 18776 KB Output is correct
3 Correct 3 ms 18776 KB Output is correct
4 Correct 152 ms 34776 KB Output is correct
5 Correct 596 ms 48184 KB Output is correct
6 Correct 418 ms 23632 KB Output is correct
7 Correct 642 ms 48180 KB Output is correct
8 Correct 348 ms 30008 KB Output is correct
9 Correct 650 ms 48184 KB Output is correct
10 Correct 726 ms 48272 KB Output is correct
11 Correct 783 ms 48332 KB Output is correct
12 Correct 743 ms 48120 KB Output is correct
13 Correct 590 ms 48188 KB Output is correct
14 Correct 714 ms 48536 KB Output is correct
15 Correct 606 ms 48952 KB Output is correct
16 Correct 593 ms 48944 KB Output is correct
17 Correct 3 ms 18776 KB Output is correct
18 Correct 2 ms 18776 KB Output is correct
19 Correct 3 ms 18776 KB Output is correct
20 Correct 4 ms 18776 KB Output is correct
21 Correct 4 ms 18776 KB Output is correct
22 Correct 3 ms 18776 KB Output is correct
23 Correct 3 ms 18888 KB Output is correct
24 Correct 3 ms 19028 KB Output is correct
25 Correct 2 ms 18880 KB Output is correct
26 Correct 3 ms 18776 KB Output is correct
27 Correct 15 ms 19056 KB Output is correct
28 Correct 15 ms 19032 KB Output is correct
29 Correct 16 ms 19032 KB Output is correct
30 Correct 13 ms 19032 KB Output is correct
31 Correct 10 ms 19032 KB Output is correct
32 Correct 3 ms 18776 KB Output is correct
33 Correct 26 ms 38856 KB Output is correct
34 Correct 56 ms 48204 KB Output is correct
35 Correct 47 ms 48324 KB Output is correct
36 Correct 70 ms 48364 KB Output is correct
37 Correct 59 ms 48524 KB Output is correct
38 Correct 45 ms 48952 KB Output is correct
39 Correct 2 ms 18776 KB Output is correct
40 Correct 3 ms 18776 KB Output is correct
41 Correct 3 ms 18776 KB Output is correct
42 Correct 154 ms 34460 KB Output is correct
43 Correct 594 ms 48128 KB Output is correct
44 Correct 422 ms 23884 KB Output is correct
45 Correct 595 ms 48104 KB Output is correct
46 Correct 367 ms 30512 KB Output is correct
47 Correct 649 ms 48128 KB Output is correct
48 Correct 748 ms 48344 KB Output is correct
49 Correct 758 ms 48328 KB Output is correct
50 Correct 747 ms 48320 KB Output is correct
51 Correct 632 ms 48136 KB Output is correct
52 Correct 696 ms 48376 KB Output is correct
53 Correct 564 ms 49004 KB Output is correct
54 Correct 592 ms 49012 KB Output is correct
55 Correct 2 ms 18776 KB Output is correct
56 Correct 82 ms 47960 KB Output is correct
57 Correct 595 ms 48120 KB Output is correct
58 Correct 314 ms 25664 KB Output is correct
59 Correct 639 ms 48184 KB Output is correct
60 Correct 253 ms 32292 KB Output is correct
61 Correct 599 ms 48184 KB Output is correct
62 Correct 741 ms 48272 KB Output is correct
63 Correct 708 ms 48308 KB Output is correct
64 Correct 769 ms 48304 KB Output is correct
65 Correct 688 ms 48184 KB Output is correct
66 Correct 713 ms 48364 KB Output is correct
67 Correct 685 ms 48944 KB Output is correct
68 Correct 584 ms 49012 KB Output is correct
69 Correct 3 ms 18776 KB Output is correct
70 Correct 3 ms 18776 KB Output is correct
71 Correct 3 ms 18776 KB Output is correct
72 Correct 4 ms 18776 KB Output is correct
73 Correct 3 ms 18776 KB Output is correct
74 Correct 3 ms 18776 KB Output is correct
75 Correct 4 ms 18784 KB Output is correct
76 Correct 2 ms 18776 KB Output is correct
77 Correct 3 ms 18776 KB Output is correct
78 Correct 3 ms 18776 KB Output is correct
79 Correct 4 ms 18776 KB Output is correct
80 Correct 3 ms 18776 KB Output is correct
81 Correct 4 ms 18776 KB Output is correct
82 Correct 4 ms 18776 KB Output is correct
83 Correct 3 ms 18776 KB Output is correct
84 Correct 3 ms 18776 KB Output is correct
85 Correct 5 ms 18776 KB Output is correct
86 Correct 15 ms 18892 KB Output is correct
87 Correct 15 ms 19032 KB Output is correct
88 Correct 12 ms 19032 KB Output is correct
89 Correct 14 ms 19284 KB Output is correct
90 Correct 13 ms 19032 KB Output is correct
91 Correct 3 ms 18776 KB Output is correct
92 Correct 3 ms 18776 KB Output is correct
93 Correct 13 ms 19032 KB Output is correct
94 Correct 12 ms 19032 KB Output is correct
95 Correct 12 ms 19032 KB Output is correct
96 Correct 11 ms 19032 KB Output is correct
97 Correct 11 ms 19032 KB Output is correct
98 Correct 3 ms 18776 KB Output is correct
99 Correct 67 ms 48172 KB Output is correct
100 Correct 69 ms 48184 KB Output is correct
101 Correct 57 ms 48324 KB Output is correct
102 Correct 59 ms 48156 KB Output is correct
103 Correct 62 ms 48540 KB Output is correct
104 Correct 65 ms 48988 KB Output is correct
105 Correct 3 ms 18776 KB Output is correct
106 Correct 30 ms 38980 KB Output is correct
107 Correct 77 ms 48180 KB Output is correct
108 Correct 59 ms 48344 KB Output is correct
109 Correct 64 ms 48152 KB Output is correct
110 Correct 62 ms 48536 KB Output is correct
111 Correct 55 ms 48948 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18776 KB Output is correct
2 Correct 3 ms 18776 KB Output is correct
3 Correct 83 ms 45764 KB Output is correct
4 Correct 596 ms 48260 KB Output is correct
5 Correct 517 ms 36772 KB Output is correct
6 Correct 655 ms 48324 KB Output is correct
7 Correct 456 ms 41336 KB Output is correct
8 Correct 623 ms 48272 KB Output is correct
9 Correct 3 ms 18776 KB Output is correct
10 Correct 2 ms 18776 KB Output is correct
11 Correct 2 ms 18776 KB Output is correct
12 Correct 3 ms 18976 KB Output is correct
13 Incorrect 3 ms 18776 KB Output isn't correct
14 Halted 0 ms 0 KB -