oj.uz

Submission #980290

# Submission time Handle Problem Language Result Execution time Memory
980290 2024-05-12T03:03:01 Z Tsagana Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 762 ms 42756 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 lb lower_bound
#define ub upper_bound
#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];
 
  void build(int id, int L, int R) {
    if (L == R) {t[id] = {h[L], L}; return ;}
    meta;
    build(x, L, M);
    build(y, M + 1, R);
    t[id] = max(t[x], t[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);}
 
  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 count(int A, int B, int C, int D) {
    A = query(max(A, lj[query(C, D).S] + 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;
  }
} 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 3 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 87 ms 39484 KB Output is correct
4 Correct 554 ms 42008 KB Output is correct
5 Correct 517 ms 30636 KB Output is correct
6 Correct 616 ms 41972 KB Output is correct
7 Correct 486 ms 35060 KB Output is correct
8 Correct 589 ms 41976 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12628 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 2 ms 12632 KB Output is correct
5 Incorrect 2 ms 12632 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 12632 KB Output is correct
2 Correct 2 ms 12884 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 2 ms 12632 KB Output is correct
5 Incorrect 35 ms 39224 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 2 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 158 ms 28416 KB Output is correct
5 Correct 645 ms 41892 KB Output is correct
6 Correct 407 ms 17232 KB Output is correct
7 Correct 610 ms 41932 KB Output is correct
8 Correct 337 ms 23972 KB Output is correct
9 Correct 632 ms 41808 KB Output is correct
10 Correct 755 ms 42056 KB Output is correct
11 Correct 730 ms 41960 KB Output is correct
12 Correct 728 ms 41840 KB Output is correct
13 Correct 660 ms 41884 KB Output is correct
14 Correct 762 ms 42272 KB Output is correct
15 Correct 624 ms 42664 KB Output is correct
16 Correct 616 ms 42756 KB Output is correct
17 Correct 2 ms 12632 KB Output is correct
18 Correct 2 ms 12632 KB Output is correct
19 Correct 2 ms 12632 KB Output is correct
20 Correct 3 ms 12632 KB Output is correct
21 Correct 3 ms 12632 KB Output is correct
22 Correct 2 ms 12632 KB Output is correct
23 Correct 2 ms 12632 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 2 ms 12632 KB Output is correct
26 Correct 2 ms 12632 KB Output is correct
27 Correct 10 ms 12632 KB Output is correct
28 Correct 11 ms 12632 KB Output is correct
29 Correct 9 ms 12632 KB Output is correct
30 Correct 10 ms 12632 KB Output is correct
31 Correct 14 ms 12632 KB Output is correct
32 Correct 2 ms 12632 KB Output is correct
33 Correct 24 ms 32716 KB Output is correct
34 Correct 62 ms 42136 KB Output is correct
35 Correct 53 ms 42216 KB Output is correct
36 Correct 50 ms 41920 KB Output is correct
37 Correct 52 ms 42076 KB Output is correct
38 Correct 48 ms 42656 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 158 ms 28416 KB Output is correct
5 Correct 645 ms 41892 KB Output is correct
6 Correct 407 ms 17232 KB Output is correct
7 Correct 610 ms 41932 KB Output is correct
8 Correct 337 ms 23972 KB Output is correct
9 Correct 632 ms 41808 KB Output is correct
10 Correct 755 ms 42056 KB Output is correct
11 Correct 730 ms 41960 KB Output is correct
12 Correct 728 ms 41840 KB Output is correct
13 Correct 660 ms 41884 KB Output is correct
14 Correct 762 ms 42272 KB Output is correct
15 Correct 624 ms 42664 KB Output is correct
16 Correct 616 ms 42756 KB Output is correct
17 Correct 2 ms 12632 KB Output is correct
18 Correct 2 ms 12632 KB Output is correct
19 Correct 2 ms 12632 KB Output is correct
20 Correct 3 ms 12632 KB Output is correct
21 Correct 3 ms 12632 KB Output is correct
22 Correct 2 ms 12632 KB Output is correct
23 Correct 2 ms 12632 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 2 ms 12632 KB Output is correct
26 Correct 2 ms 12632 KB Output is correct
27 Correct 10 ms 12632 KB Output is correct
28 Correct 11 ms 12632 KB Output is correct
29 Correct 9 ms 12632 KB Output is correct
30 Correct 10 ms 12632 KB Output is correct
31 Correct 14 ms 12632 KB Output is correct
32 Correct 2 ms 12632 KB Output is correct
33 Correct 24 ms 32716 KB Output is correct
34 Correct 62 ms 42136 KB Output is correct
35 Correct 53 ms 42216 KB Output is correct
36 Correct 50 ms 41920 KB Output is correct
37 Correct 52 ms 42076 KB Output is correct
38 Correct 48 ms 42656 KB Output is correct
39 Correct 2 ms 12632 KB Output is correct
40 Correct 2 ms 12632 KB Output is correct
41 Correct 2 ms 12632 KB Output is correct
42 Correct 141 ms 28216 KB Output is correct
43 Correct 608 ms 41868 KB Output is correct
44 Correct 392 ms 17204 KB Output is correct
45 Correct 628 ms 41888 KB Output is correct
46 Correct 326 ms 23984 KB Output is correct
47 Correct 602 ms 41888 KB Output is correct
48 Correct 761 ms 42128 KB Output is correct
49 Correct 752 ms 41936 KB Output is correct
50 Correct 744 ms 42008 KB Output is correct
51 Correct 592 ms 41916 KB Output is correct
52 Correct 716 ms 42076 KB Output is correct
53 Correct 614 ms 42732 KB Output is correct
54 Correct 555 ms 42664 KB Output is correct
55 Correct 2 ms 12632 KB Output is correct
56 Correct 84 ms 41904 KB Output is correct
57 Correct 559 ms 41932 KB Output is correct
58 Correct 275 ms 19264 KB Output is correct
59 Correct 615 ms 41912 KB Output is correct
60 Correct 258 ms 25896 KB Output is correct
61 Correct 615 ms 41892 KB Output is correct
62 Correct 746 ms 42080 KB Output is correct
63 Correct 736 ms 42076 KB Output is correct
64 Correct 735 ms 42080 KB Output is correct
65 Correct 640 ms 41896 KB Output is correct
66 Correct 680 ms 42272 KB Output is correct
67 Correct 610 ms 42544 KB Output is correct
68 Correct 592 ms 42668 KB Output is correct
69 Correct 1 ms 12632 KB Output is correct
70 Correct 2 ms 12632 KB Output is correct
71 Correct 2 ms 12704 KB Output is correct
72 Correct 2 ms 12632 KB Output is correct
73 Correct 2 ms 12632 KB Output is correct
74 Correct 2 ms 12632 KB Output is correct
75 Correct 2 ms 12632 KB Output is correct
76 Correct 2 ms 12632 KB Output is correct
77 Correct 2 ms 12632 KB Output is correct
78 Correct 2 ms 12632 KB Output is correct
79 Correct 3 ms 12632 KB Output is correct
80 Correct 3 ms 12632 KB Output is correct
81 Correct 2 ms 12708 KB Output is correct
82 Correct 3 ms 12632 KB Output is correct
83 Correct 2 ms 12632 KB Output is correct
84 Correct 2 ms 12632 KB Output is correct
85 Correct 3 ms 12632 KB Output is correct
86 Correct 9 ms 12632 KB Output is correct
87 Correct 9 ms 12632 KB Output is correct
88 Correct 12 ms 12632 KB Output is correct
89 Correct 12 ms 12632 KB Output is correct
90 Correct 9 ms 12632 KB Output is correct
91 Correct 2 ms 12632 KB Output is correct
92 Correct 2 ms 12632 KB Output is correct
93 Correct 12 ms 12632 KB Output is correct
94 Correct 11 ms 12632 KB Output is correct
95 Correct 13 ms 12632 KB Output is correct
96 Correct 10 ms 12632 KB Output is correct
97 Correct 9 ms 12632 KB Output is correct
98 Correct 2 ms 12632 KB Output is correct
99 Correct 74 ms 41888 KB Output is correct
100 Correct 51 ms 41868 KB Output is correct
101 Correct 49 ms 41924 KB Output is correct
102 Correct 59 ms 41916 KB Output is correct
103 Correct 59 ms 42628 KB Output is correct
104 Correct 53 ms 42756 KB Output is correct
105 Correct 2 ms 12632 KB Output is correct
106 Correct 33 ms 32728 KB Output is correct
107 Correct 56 ms 41924 KB Output is correct
108 Correct 45 ms 41848 KB Output is correct
109 Correct 54 ms 41784 KB Output is correct
110 Correct 68 ms 42204 KB Output is correct
111 Correct 57 ms 42744 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 87 ms 39484 KB Output is correct
4 Correct 554 ms 42008 KB Output is correct
5 Correct 517 ms 30636 KB Output is correct
6 Correct 616 ms 41972 KB Output is correct
7 Correct 486 ms 35060 KB Output is correct
8 Correct 589 ms 41976 KB Output is correct
9 Correct 2 ms 12632 KB Output is correct
10 Correct 2 ms 12628 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12632 KB Output is correct
13 Incorrect 2 ms 12632 KB Output isn't correct
14 Halted 0 ms 0 KB -