oj.uz

Submission #731244

# Submission time Handle Problem Language Result Execution time Memory
731244 2023-04-27T08:10:22 Z Magikarp4000 Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1234 ms 67772 KB 
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int MAXN = 2e5+1, LOG = 19;
int n;
int v[MAXN][2];
int l[MAXN], r[MAXN];
int jump[MAXN][LOG], jump1[MAXN][LOG], jl[MAXN][LOG];
int sp[MAXN][LOG];
int h[MAXN];
int lg[MAXN];

void init(int N, std::vector<int> H) {
  n = N;
  FOR(i,1,n+1) h[i] = H[i-1];
  FOR(i,2,n+1) lg[i] = lg[i>>1]+1;
  stack<PII> st;
  FOR(i,1,n+1) {
    while (!st.empty() && st.top().F <= h[i]) st.pop();
    if (st.empty()) l[i] = 0;
    else l[i] = st.top().S;
    st.push({h[i],i});
  }
  while (!st.empty()) st.pop();
  FORR(i,n,0) {
    while (!st.empty() && st.top().F <= h[i]) st.pop();
    if (st.empty()) r[i] = 0;
    else r[i] = st.top().S;
    st.push({h[i],i});
  }
  
  FOR(i,1,n+1) {
    int c = l[i] == 0 ? 0: h[l[i]];
    int d = r[i] == 0 ? 0: h[r[i]];
    v[i][0] = l[i];
    v[i][1] = r[i];
    if (c < d) swap(v[i][0], v[i][1]);
  }
  // FOR(i,1,n+1) cout << v[i][0] << ' ';
  // cout << ln;
  // FOR(i,1,n+1) cout << v[i][1] << ' ';
  // cout << ln;
  FOR(i,1,n+1) {
    jump[i][0] = v[i][0];
    jump1[i][0] = v[i][1];
    jl[i][0] = l[i];
    sp[i][0] = h[i];
  }
  FOR(j,1,LOG) {
    FOR(i,1,n+1) {
      jump[i][j] = jump[jump[i][j-1]][j-1];
      jump1[i][j] = jump1[jump1[i][j-1]][j-1];
      jl[i][j] = jl[jl[i][j-1]][j-1];
      if (i+(1<<(j-1)) <= n) sp[i][j] = max(sp[i][j-1], sp[i+(1<<(j-1))][j-1]);
      else sp[i][j] = sp[i][j-1];
    }
  }
}

int query(int a, int b) {
  int len = lg[b-a+1];
  return max(sp[a][len], sp[b-(1<<len)+1][len]);
}

int minimum_jumps(int a, int b, int c, int d) {
  a++; b++; c++; d++;
  //cout << a << ' ' << c << ln;
  int mx = query(c,d);
  int res = 0;
  int x = b;
  FORR(j,LOG-1,-1) {
    if (jl[x][j] >= a && h[jl[x][j]] < mx) {
      x = jl[x][j];
    }
  }
  if (h[x] > mx) return -1;
  FORR(j,LOG-1,-1) {
    if ((c <= v[x][0] && v[x][0] <= d) || (c <= v[x][1] && v[x][1] <= d)) return res+1;
    if (jump[x][j] != 0 && jump[x][j] < c && h[jump[x][j]] < mx) {
      res += (1<<j);
      x = jump[x][j];
    }
  }
  FORR(j,LOG-1,-1) {
    if ((c <= v[x][0] && v[x][0] <= d) || (c <= v[x][1] && v[x][1] <= d)) return res+1;
    if (jump1[x][j] != 0 && jump1[x][j] < c && h[jump1[x][j]] < mx) {
      res += (1<<j);
      x = jump1[x][j];
    }
  }
  x = r[x];
  res++;
  // if ((c <= v[x][0] <= d) || (c <= v[x][1] <= d)) return res+1;
  if (x < c || x > d) return -1;
  return res;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 197 ms 53924 KB Output is correct
4 Correct 1051 ms 67636 KB Output is correct
5 Correct 700 ms 34272 KB Output is correct
6 Correct 901 ms 67772 KB Output is correct
7 Correct 809 ms 46384 KB Output is correct
8 Correct 1059 ms 67656 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 3 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Incorrect 5 ms 336 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 3 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Incorrect 5 ms 336 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 111 ms 53232 KB Output is correct
6 Correct 139 ms 66048 KB Output is correct
7 Correct 75 ms 33948 KB Output is correct
8 Correct 125 ms 65952 KB Output is correct
9 Correct 19 ms 10192 KB Output is correct
10 Correct 129 ms 66084 KB Output is correct
11 Correct 131 ms 67764 KB Output is correct
12 Correct 131 ms 67252 KB Output is correct
13 Correct 125 ms 67184 KB Output is correct
14 Correct 143 ms 65952 KB Output is correct
15 Incorrect 164 ms 66644 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 267 ms 30364 KB Output is correct
5 Correct 876 ms 66040 KB Output is correct
6 Correct 750 ms 11196 KB Output is correct
7 Correct 959 ms 66048 KB Output is correct
8 Correct 579 ms 22976 KB Output is correct
9 Correct 702 ms 65992 KB Output is correct
10 Correct 1018 ms 67600 KB Output is correct
11 Correct 726 ms 67592 KB Output is correct
12 Correct 955 ms 67472 KB Output is correct
13 Correct 1068 ms 66048 KB Output is correct
14 Correct 1197 ms 66644 KB Output is correct
15 Correct 851 ms 67604 KB Output is correct
16 Correct 1118 ms 67676 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 3 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 18 ms 976 KB Output is correct
28 Correct 10 ms 976 KB Output is correct
29 Correct 19 ms 976 KB Output is correct
30 Correct 21 ms 976 KB Output is correct
31 Correct 20 ms 976 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 85 ms 38380 KB Output is correct
34 Correct 130 ms 65956 KB Output is correct
35 Correct 139 ms 67444 KB Output is correct
36 Correct 129 ms 65952 KB Output is correct
37 Correct 192 ms 66640 KB Output is correct
38 Correct 124 ms 67564 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 267 ms 30364 KB Output is correct
5 Correct 876 ms 66040 KB Output is correct
6 Correct 750 ms 11196 KB Output is correct
7 Correct 959 ms 66048 KB Output is correct
8 Correct 579 ms 22976 KB Output is correct
9 Correct 702 ms 65992 KB Output is correct
10 Correct 1018 ms 67600 KB Output is correct
11 Correct 726 ms 67592 KB Output is correct
12 Correct 955 ms 67472 KB Output is correct
13 Correct 1068 ms 66048 KB Output is correct
14 Correct 1197 ms 66644 KB Output is correct
15 Correct 851 ms 67604 KB Output is correct
16 Correct 1118 ms 67676 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 3 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 18 ms 976 KB Output is correct
28 Correct 10 ms 976 KB Output is correct
29 Correct 19 ms 976 KB Output is correct
30 Correct 21 ms 976 KB Output is correct
31 Correct 20 ms 976 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 85 ms 38380 KB Output is correct
34 Correct 130 ms 65956 KB Output is correct
35 Correct 139 ms 67444 KB Output is correct
36 Correct 129 ms 65952 KB Output is correct
37 Correct 192 ms 66640 KB Output is correct
38 Correct 124 ms 67564 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 0 ms 336 KB Output is correct
41 Correct 0 ms 336 KB Output is correct
42 Correct 228 ms 30412 KB Output is correct
43 Correct 988 ms 66000 KB Output is correct
44 Correct 656 ms 11088 KB Output is correct
45 Correct 770 ms 66048 KB Output is correct
46 Correct 569 ms 22892 KB Output is correct
47 Correct 886 ms 66016 KB Output is correct
48 Correct 799 ms 67692 KB Output is correct
49 Correct 761 ms 67508 KB Output is correct
50 Correct 1020 ms 67396 KB Output is correct
51 Correct 812 ms 66096 KB Output is correct
52 Correct 1234 ms 66644 KB Output is correct
53 Correct 883 ms 67772 KB Output is correct
54 Correct 897 ms 67632 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 200 ms 65812 KB Output is correct
57 Correct 804 ms 66096 KB Output is correct
58 Correct 311 ms 11816 KB Output is correct
59 Correct 985 ms 65992 KB Output is correct
60 Correct 431 ms 23700 KB Output is correct
61 Correct 1088 ms 65976 KB Output is correct
62 Correct 879 ms 67764 KB Output is correct
63 Correct 1221 ms 67272 KB Output is correct
64 Correct 896 ms 67016 KB Output is correct
65 Correct 1002 ms 65956 KB Output is correct
66 Correct 1130 ms 66512 KB Output is correct
67 Correct 1073 ms 67588 KB Output is correct
68 Correct 976 ms 67616 KB Output is correct
69 Correct 0 ms 336 KB Output is correct
70 Correct 1 ms 296 KB Output is correct
71 Correct 3 ms 336 KB Output is correct
72 Correct 2 ms 336 KB Output is correct
73 Correct 3 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 1 ms 336 KB Output is correct
77 Correct 1 ms 336 KB Output is correct
78 Correct 2 ms 336 KB Output is correct
79 Correct 3 ms 336 KB Output is correct
80 Correct 2 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 4 ms 336 KB Output is correct
86 Correct 20 ms 976 KB Output is correct
87 Correct 24 ms 976 KB Output is correct
88 Correct 17 ms 976 KB Output is correct
89 Correct 22 ms 976 KB Output is correct
90 Correct 22 ms 976 KB Output is correct
91 Correct 1 ms 424 KB Output is correct
92 Correct 1 ms 592 KB Output is correct
93 Correct 23 ms 976 KB Output is correct
94 Correct 19 ms 976 KB Output is correct
95 Correct 21 ms 976 KB Output is correct
96 Correct 16 ms 976 KB Output is correct
97 Correct 17 ms 976 KB Output is correct
98 Correct 0 ms 336 KB Output is correct
99 Correct 128 ms 65832 KB Output is correct
100 Correct 145 ms 65952 KB Output is correct
101 Correct 120 ms 67272 KB Output is correct
102 Correct 125 ms 65972 KB Output is correct
103 Correct 200 ms 66648 KB Output is correct
104 Correct 128 ms 67696 KB Output is correct
105 Correct 1 ms 336 KB Output is correct
106 Correct 79 ms 38404 KB Output is correct
107 Correct 142 ms 65980 KB Output is correct
108 Correct 123 ms 67364 KB Output is correct
109 Correct 146 ms 65992 KB Output is correct
110 Correct 178 ms 66640 KB Output is correct
111 Correct 128 ms 67616 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 197 ms 53924 KB Output is correct
4 Correct 1051 ms 67636 KB Output is correct
5 Correct 700 ms 34272 KB Output is correct
6 Correct 901 ms 67772 KB Output is correct
7 Correct 809 ms 46384 KB Output is correct
8 Correct 1059 ms 67656 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Incorrect 5 ms 336 KB Output isn't correct
19 Halted 0 ms 0 KB -