oj.uz

Submission #541964

# Submission time Handle Problem Language Result Execution time Memory
541964 2022-03-24T21:53:29 Z aryan12 Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1102 ms 37724 KB 
#include "jumps.h"
#include <vector>
using namespace std;
#include <bits/stdc++.h>

const int MAXN = 2e5 + 5;
int DP_Min[19][MAXN], DP_Max[19][MAXN];
int seg[MAXN * 4];
vector<int> INPUT;
vector<int> omk(MAXN);
int okN;

void Build(int l, int r, int pos) {
  if(l == r) {
    seg[pos] = INPUT[l - 1];
    return;
  }
  int mid = (l + r) >> 1;
  Build(l, mid, pos * 2);
  Build(mid + 1, r, pos * 2 + 1);
  seg[pos] = max(seg[pos * 2], seg[pos * 2 + 1]);
}

pair<int, int> Query(int l, int r, int pos, int ql, int qr, int qval) {
  if(ql > r || l > qr) {
    //cout << "l = " << l << ", r = " << r << ", there {-1, -1}\n";
    return {0, 0};
  }
  if(l == r) {
    if(seg[pos] >= qval) {
      //cout << "l = " << l << ", r = " << r << ", here {-1, -1}\n";
      return {-1, -1};
    }
    //cout << "l = " << l << ", r = " << r << ", {" << seg[pos] << ", " << seg[pos] << "}\n";
    return {seg[pos], seg[pos]};
  }
  if(ql <= l && r <= qr && seg[pos] < qval) {
    return {seg[pos], seg[pos]};
  }
  int mid = (l + r) >> 1;
  pair<int, int> x = Query(mid + 1, r, pos * 2 + 1, ql, qr, qval);
  if(x.second == -1) {
    //cout << "l = " << l << ", r = " << r << ", aftermid {" << x.first << ", -1}\n";
    return x;
  }
  pair<int, int> y = Query(l, mid, pos * 2, ql, qr, qval);
  if(y.second == -1) {
    //cout << "l = " << l << ", r = " << r << ", {" << max(y.first, x.first) << ", " << y.second << "}\n";
    return {max(y.first, x.first), -1};
  }
  //cout << "l = " << l << ", r = " << r << ", {" << max(y.first, x.first) << ", " << max(y.second, x.second) << "}\n";
  return {max(y.first, x.first), max(y.second, x.second)};
}

void init(int N, vector<int> H) {
  okN = N;
  vector<int> L(N), R(N);
  stack<int> q;
  for(int i = 0; i < N; i++) {
    omk[H[i]] = i;
    INPUT.push_back(H[i]);
    while(!q.empty() && H[q.top()] <= H[i]) {
      q.pop();
    }
    if(q.empty()) {
      L[i] = -1;
    }
    else {
      L[i] = q.top();
    }
    q.push(i);
  }
  Build(1, N, 1);
  while(!q.empty()) {
    q.pop();
  }
  for(int i = N - 1; i >= 0; i--) {
    while(!q.empty() && H[q.top()] <= H[i]) {
      q.pop();
    }
    if(q.empty()) {
      R[i] = N;
    }
    else {
      R[i] = q.top();
    }
    q.push(i);
  }
  for(int i = 0; i < N; i++) {
    if(L[i] == -1 && R[i] == N) {
      DP_Min[0][i] = -1;
      DP_Max[0][i] = -1;
    }
    else if(L[i] == -1 || R[i] == N) {
      if(L[i] == -1) {
        DP_Min[0][i] = R[i];
        DP_Max[0][i] = R[i];
      }
      else {
        DP_Min[0][i] = L[i];
        DP_Max[0][i] = L[i];
      }
    }
    else {
      if(H[L[i]] < H[R[i]]) {
        DP_Min[0][i] = L[i];
        DP_Max[0][i] = R[i];
      }
      else {
        DP_Min[0][i] = R[i];
        DP_Max[0][i] = L[i];
      }
      //DP_Min[0][i] = min(L[i], R[i]);
      //DP_Max[0][i] = max(L[i], R[i]);
    }
  }
  for(int i = 1; i < 19; i++) {
    for(int j = 0; j < N; j++) {
      if(DP_Min[i - 1][j] == -1) {
        DP_Min[i][j] = -1;
      }
      else {
        DP_Min[i][j] = DP_Min[i - 1][DP_Min[i - 1][j]];
      }
      if(DP_Max[i - 1][j] == -1) {
        DP_Max[i][j] = -1;
      }
      else {
        DP_Max[i][j] = DP_Max[i - 1][DP_Max[i - 1][j]];
      }
    }
  }
}

int minimum_jumps(int A, int B, int C, int D) {
  A++;
  B++;
  //cout << "A = " << A << ", B = " << B << ", INPUT[C] = " << INPUT[C] << "\n";
  int pos = Query(1, okN, 1, A, B, INPUT[C]).first;
  A = omk[pos];
  B = omk[pos];
  //cout << "A = " << A << ", B = " << B << "\n";
  int ans = 0, cur = B;
  for(int i = 18; i >= 0; i--) {
    if(DP_Max[i][cur] != -1 && INPUT[DP_Max[i][cur]] <= INPUT[C]) {
      //cout << "prev cur = " << cur << "\n";
      ans += (1 << i);
      cur = DP_Max[i][cur];
      //cout << "new cur = " << cur << ", with added answer: " << (1 << i) << "\n";
    }
  }
  for(int i = 18; i >= 0; i--) {
    if(DP_Min[i][cur] != -1 && INPUT[DP_Min[i][cur]] <= INPUT[C]) {
      ans += (1 << i);
      cur = DP_Min[i][cur];
    }
  }
  if(cur != C) return -1;
  return ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Correct 1 ms 1232 KB Output is correct
3 Correct 135 ms 30744 KB Output is correct
4 Correct 992 ms 37568 KB Output is correct
5 Correct 865 ms 19644 KB Output is correct
6 Correct 1006 ms 37516 KB Output is correct
7 Correct 825 ms 26808 KB Output is correct
8 Correct 1093 ms 37632 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1232 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1232 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1232 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Correct 1 ms 1232 KB Output is correct
3 Correct 1 ms 1232 KB Output is correct
4 Correct 244 ms 17836 KB Output is correct
5 Correct 685 ms 36928 KB Output is correct
6 Correct 528 ms 7404 KB Output is correct
7 Correct 770 ms 36924 KB Output is correct
8 Correct 372 ms 13992 KB Output is correct
9 Correct 886 ms 36920 KB Output is correct
10 Correct 886 ms 37604 KB Output is correct
11 Correct 967 ms 37512 KB Output is correct
12 Correct 1046 ms 37416 KB Output is correct
13 Correct 939 ms 36920 KB Output is correct
14 Correct 956 ms 37180 KB Output is correct
15 Correct 749 ms 37560 KB Output is correct
16 Correct 829 ms 37724 KB Output is correct
17 Correct 1 ms 1232 KB Output is correct
18 Correct 1 ms 1232 KB Output is correct
19 Correct 2 ms 1232 KB Output is correct
20 Correct 4 ms 1232 KB Output is correct
21 Correct 6 ms 1232 KB Output is correct
22 Correct 3 ms 1232 KB Output is correct
23 Correct 2 ms 1232 KB Output is correct
24 Correct 3 ms 1232 KB Output is correct
25 Correct 1 ms 1232 KB Output is correct
26 Correct 1 ms 1360 KB Output is correct
27 Correct 20 ms 1616 KB Output is correct
28 Correct 16 ms 1616 KB Output is correct
29 Correct 21 ms 1616 KB Output is correct
30 Correct 20 ms 1616 KB Output is correct
31 Correct 20 ms 1616 KB Output is correct
32 Correct 1 ms 1232 KB Output is correct
33 Correct 36 ms 21952 KB Output is correct
34 Correct 47 ms 36924 KB Output is correct
35 Correct 42 ms 37440 KB Output is correct
36 Correct 49 ms 36920 KB Output is correct
37 Correct 43 ms 37180 KB Output is correct
38 Correct 44 ms 37544 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Correct 1 ms 1232 KB Output is correct
3 Correct 1 ms 1232 KB Output is correct
4 Correct 244 ms 17836 KB Output is correct
5 Correct 685 ms 36928 KB Output is correct
6 Correct 528 ms 7404 KB Output is correct
7 Correct 770 ms 36924 KB Output is correct
8 Correct 372 ms 13992 KB Output is correct
9 Correct 886 ms 36920 KB Output is correct
10 Correct 886 ms 37604 KB Output is correct
11 Correct 967 ms 37512 KB Output is correct
12 Correct 1046 ms 37416 KB Output is correct
13 Correct 939 ms 36920 KB Output is correct
14 Correct 956 ms 37180 KB Output is correct
15 Correct 749 ms 37560 KB Output is correct
16 Correct 829 ms 37724 KB Output is correct
17 Correct 1 ms 1232 KB Output is correct
18 Correct 1 ms 1232 KB Output is correct
19 Correct 2 ms 1232 KB Output is correct
20 Correct 4 ms 1232 KB Output is correct
21 Correct 6 ms 1232 KB Output is correct
22 Correct 3 ms 1232 KB Output is correct
23 Correct 2 ms 1232 KB Output is correct
24 Correct 3 ms 1232 KB Output is correct
25 Correct 1 ms 1232 KB Output is correct
26 Correct 1 ms 1360 KB Output is correct
27 Correct 20 ms 1616 KB Output is correct
28 Correct 16 ms 1616 KB Output is correct
29 Correct 21 ms 1616 KB Output is correct
30 Correct 20 ms 1616 KB Output is correct
31 Correct 20 ms 1616 KB Output is correct
32 Correct 1 ms 1232 KB Output is correct
33 Correct 36 ms 21952 KB Output is correct
34 Correct 47 ms 36924 KB Output is correct
35 Correct 42 ms 37440 KB Output is correct
36 Correct 49 ms 36920 KB Output is correct
37 Correct 43 ms 37180 KB Output is correct
38 Correct 44 ms 37544 KB Output is correct
39 Correct 1 ms 1232 KB Output is correct
40 Correct 1 ms 1232 KB Output is correct
41 Correct 1 ms 1232 KB Output is correct
42 Correct 238 ms 17728 KB Output is correct
43 Correct 875 ms 36924 KB Output is correct
44 Correct 469 ms 7376 KB Output is correct
45 Correct 634 ms 36892 KB Output is correct
46 Correct 563 ms 14024 KB Output is correct
47 Correct 899 ms 36808 KB Output is correct
48 Correct 862 ms 37556 KB Output is correct
49 Correct 1102 ms 37536 KB Output is correct
50 Correct 940 ms 37436 KB Output is correct
51 Correct 901 ms 36920 KB Output is correct
52 Correct 895 ms 37180 KB Output is correct
53 Correct 776 ms 37556 KB Output is correct
54 Correct 885 ms 37568 KB Output is correct
55 Correct 1 ms 1232 KB Output is correct
56 Correct 102 ms 36792 KB Output is correct
57 Correct 784 ms 36924 KB Output is correct
58 Correct 354 ms 7856 KB Output is correct
59 Correct 767 ms 36808 KB Output is correct
60 Correct 287 ms 14280 KB Output is correct
61 Correct 901 ms 36932 KB Output is correct
62 Correct 1020 ms 37560 KB Output is correct
63 Correct 984 ms 37308 KB Output is correct
64 Correct 848 ms 37308 KB Output is correct
65 Correct 801 ms 36916 KB Output is correct
66 Correct 958 ms 37180 KB Output is correct
67 Correct 794 ms 37568 KB Output is correct
68 Correct 827 ms 37556 KB Output is correct
69 Correct 1 ms 1232 KB Output is correct
70 Correct 1 ms 1232 KB Output is correct
71 Correct 3 ms 1232 KB Output is correct
72 Correct 3 ms 1232 KB Output is correct
73 Correct 2 ms 1232 KB Output is correct
74 Correct 3 ms 1232 KB Output is correct
75 Correct 3 ms 1232 KB Output is correct
76 Correct 1 ms 1232 KB Output is correct
77 Correct 1 ms 1232 KB Output is correct
78 Correct 2 ms 1232 KB Output is correct
79 Correct 3 ms 1232 KB Output is correct
80 Correct 3 ms 1232 KB Output is correct
81 Correct 3 ms 1232 KB Output is correct
82 Correct 2 ms 1232 KB Output is correct
83 Correct 2 ms 1232 KB Output is correct
84 Correct 1 ms 1232 KB Output is correct
85 Correct 4 ms 1232 KB Output is correct
86 Correct 18 ms 1616 KB Output is correct
87 Correct 19 ms 1616 KB Output is correct
88 Correct 18 ms 1616 KB Output is correct
89 Correct 19 ms 1616 KB Output is correct
90 Correct 23 ms 1616 KB Output is correct
91 Correct 1 ms 1232 KB Output is correct
92 Correct 1 ms 1360 KB Output is correct
93 Correct 20 ms 1616 KB Output is correct
94 Correct 18 ms 1616 KB Output is correct
95 Correct 17 ms 1616 KB Output is correct
96 Correct 18 ms 1616 KB Output is correct
97 Correct 17 ms 1616 KB Output is correct
98 Correct 1 ms 1232 KB Output is correct
99 Correct 46 ms 36788 KB Output is correct
100 Correct 46 ms 36924 KB Output is correct
101 Correct 39 ms 37428 KB Output is correct
102 Correct 45 ms 36844 KB Output is correct
103 Correct 41 ms 37212 KB Output is correct
104 Correct 40 ms 37568 KB Output is correct
105 Correct 1 ms 1232 KB Output is correct
106 Correct 28 ms 21876 KB Output is correct
107 Correct 46 ms 36912 KB Output is correct
108 Correct 56 ms 37432 KB Output is correct
109 Correct 45 ms 36916 KB Output is correct
110 Correct 42 ms 37116 KB Output is correct
111 Correct 42 ms 37584 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Correct 1 ms 1232 KB Output is correct
3 Correct 135 ms 30744 KB Output is correct
4 Correct 992 ms 37568 KB Output is correct
5 Correct 865 ms 19644 KB Output is correct
6 Correct 1006 ms 37516 KB Output is correct
7 Correct 825 ms 26808 KB Output is correct
8 Correct 1093 ms 37632 KB Output is correct
9 Incorrect 1 ms 1232 KB Output isn't correct
10 Halted 0 ms 0 KB -