oj.uz

Submission #980651

# Submission time Handle Problem Language Result Execution time Memory
980651 2024-05-12T09:46:42 Z vjudge1 Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1285 ms 57880 KB 
#include "jumps.h"
#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define ff first
#define ss second
const int mod = 1e9 + 7;
const int inf = 1e9;
const int logn = 20;

template<typename T>
int len(T &a){return a.size();}


vector<vector<int>> up, low;

int n;
bool sub1 = 1;



vector<int> h; vector<int> pos;

struct SparseT{
  vector<vector<int>> t;
  int n, logn;
  int join(int a, int b){
    return max(a,b);
  }

  int neutral(){
    return 0;
  }

  SparseT (){}

  SparseT (int _n){
    init(_n);
  }

  SparseT (vector<int> &a){
    build(a);
  }

  void init(int _n){
    n = _n;
    logn = 32 - __builtin_clz(n);
    t.assign(_n, vector<int>(logn, neutral()));
  }

  void build(vector<int> &a){
    init((int)(a.size()));
    for(int i = 0; i < n; i ++){
      t[i][0] = a[i];
    }

    for(int i = 1; i < logn; i ++){
      for(int j = 0; j + (1 << i) <= n; j ++){
        t[j][i] = join(t[j][i - 1], t[j + (1 << (i - 1))][i - 1]);
      }
    }
  }

  int get(int l, int r){
    if(l > r) return neutral();
    int k = 31 - __builtin_clz(r - l + 1);
    return join(t[l][k], t[r - (1 << k) + 1][k]); 
  }
} t;


void init(int N, vector<int> H) {
  h = H;
  n = N;
  pos.resize(n);
  for(int i = 0; i < n; i ++) h[i] --;
  for(int i = 0; i < n; i ++) pos[h[i]] = i;
  vector<int> st;
  vector<int> lef(n), rig(n);
  for(int i = 0; i < n; i ++){
    if(h[i] != i + 1) sub1 = 0;
    while(!st.empty() && st.back() <= h[i]) st.pop_back();
    if(st.empty()) lef[i] = -1;
    else lef[i] = st.back();
    st.push_back(h[i]);
  }
  if(sub1) return;
  st.clear();
  for(int i = n - 1; i >= 0; i --){
    while(!st.empty() && st.back() <= h[i]) st.pop_back();
    if(st.empty()) rig[i] = -1;
    else rig[i] = st.back();
    st.push_back(h[i]);
  }

  up.assign(logn, vector<int> (n, -1));
  low.assign(logn, vector<int> (n, -1));

  for(int i = 0; i < n; i ++){
    up[0][h[i]] = max(lef[i], rig[i]);
  }
  t.build(h);
  // first max, then min
  for(int j = 1; j < logn; j ++){
    for(int i = 0; i < n; i ++){
      if(up[j - 1][i] == -1) continue;
      //cout << (up[j][i]) << endl;
      up[j][i] = up[j - 1][up[j - 1][i]];
    }
  }

  for(int i = 0; i < n; i ++){
    if(lef[i] == -1 && rig[i] == -1) continue;
    if(lef[i] == -1) low[0][h[i]] = rig[i];
    else if(rig[i] == -1) low[0][h[i]] = rig[i];
    else low[0][h[i]] = min(rig[i], lef[i]);
  }

  for(int j = 1; j < logn; j ++){
    for(int i = 0; i < n; i ++){
      if(low[j - 1][i] == -1) continue;
      low[j][i] = low[j - 1][low[j - 1][i]];
    }
  }
}

int minimum_jumps(int A, int B, int C, int D) {
  if(sub1) return C - B;
  int obst = t.get(B, C - 1);
  int mxx = t.get(C, D);
  if(mxx <= obst) return -1;


  int l = A - 1, r = B;
  while(r - l > 1){
    int m = (l + r) / 2;
    if(t.get(m, C - 1) < mxx){
      r = m;
    }else l = m;
  }

  int st = t.get(r, B);
  obst = max(obst, st);

  l = C - 1, r = D + 1;

  while(r - l > 1){
    int m = (l + r) / 2;
    if(t.get(C, m) > obst) r = m;
    else l = m;
  }
  int tar = t.get(C, r);

  int ans = 0;
  for(int j = logn - 1; j >= 0; j --){
    if(up[j][st] != -1 && up[j][st] <= tar){
      st = up[j][st];
      ans += 1 << j;
    }
  }

  for(int j = logn - 1; j >= 0; j --){
    if(low[j][st] != -1 && low[j][st] <= tar){
      ans += 1 << j;
      st = low[j][st];
    }
  }

  return ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 169 ms 45924 KB Output is correct
4 Correct 1195 ms 57636 KB Output is correct
5 Correct 874 ms 29232 KB Output is correct
6 Correct 1225 ms 57636 KB Output is correct
7 Correct 979 ms 39460 KB Output is correct
8 Correct 1285 ms 57880 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 54 ms 45744 KB Output is correct
6 Correct 74 ms 56752 KB Output is correct
7 Correct 32 ms 29116 KB Output is correct
8 Correct 80 ms 56928 KB Output is correct
9 Correct 9 ms 8792 KB Output is correct
10 Correct 73 ms 56732 KB Output is correct
11 Correct 68 ms 57520 KB Output is correct
12 Correct 70 ms 57372 KB Output is correct
13 Incorrect 68 ms 57416 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 164 ms 26016 KB Output is correct
5 Correct 702 ms 56876 KB Output is correct
6 Correct 439 ms 9684 KB Output is correct
7 Correct 661 ms 56856 KB Output is correct
8 Correct 358 ms 19924 KB Output is correct
9 Correct 679 ms 56748 KB Output is correct
10 Correct 782 ms 57620 KB Output is correct
11 Correct 749 ms 57456 KB Output is correct
12 Correct 722 ms 57384 KB Output is correct
13 Correct 611 ms 56712 KB Output is correct
14 Correct 788 ms 57124 KB Output is correct
15 Correct 694 ms 57424 KB Output is correct
16 Correct 750 ms 57640 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 8 ms 1216 KB Output is correct
28 Correct 12 ms 976 KB Output is correct
29 Correct 8 ms 964 KB Output is correct
30 Correct 10 ms 856 KB Output is correct
31 Correct 9 ms 972 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 36 ms 32948 KB Output is correct
34 Correct 72 ms 56756 KB Output is correct
35 Correct 70 ms 57300 KB Output is correct
36 Correct 75 ms 56852 KB Output is correct
37 Correct 69 ms 57128 KB Output is correct
38 Correct 71 ms 57560 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 164 ms 26016 KB Output is correct
5 Correct 702 ms 56876 KB Output is correct
6 Correct 439 ms 9684 KB Output is correct
7 Correct 661 ms 56856 KB Output is correct
8 Correct 358 ms 19924 KB Output is correct
9 Correct 679 ms 56748 KB Output is correct
10 Correct 782 ms 57620 KB Output is correct
11 Correct 749 ms 57456 KB Output is correct
12 Correct 722 ms 57384 KB Output is correct
13 Correct 611 ms 56712 KB Output is correct
14 Correct 788 ms 57124 KB Output is correct
15 Correct 694 ms 57424 KB Output is correct
16 Correct 750 ms 57640 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 8 ms 1216 KB Output is correct
28 Correct 12 ms 976 KB Output is correct
29 Correct 8 ms 964 KB Output is correct
30 Correct 10 ms 856 KB Output is correct
31 Correct 9 ms 972 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 36 ms 32948 KB Output is correct
34 Correct 72 ms 56756 KB Output is correct
35 Correct 70 ms 57300 KB Output is correct
36 Correct 75 ms 56852 KB Output is correct
37 Correct 69 ms 57128 KB Output is correct
38 Correct 71 ms 57560 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 142 ms 26076 KB Output is correct
43 Correct 650 ms 56748 KB Output is correct
44 Correct 403 ms 9684 KB Output is correct
45 Correct 660 ms 56756 KB Output is correct
46 Correct 372 ms 19844 KB Output is correct
47 Correct 636 ms 56644 KB Output is correct
48 Correct 803 ms 57632 KB Output is correct
49 Correct 756 ms 57384 KB Output is correct
50 Correct 764 ms 57552 KB Output is correct
51 Correct 612 ms 56852 KB Output is correct
52 Correct 801 ms 57128 KB Output is correct
53 Correct 638 ms 57616 KB Output is correct
54 Correct 669 ms 57640 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 114 ms 56612 KB Output is correct
57 Correct 619 ms 56732 KB Output is correct
58 Correct 276 ms 10188 KB Output is correct
59 Correct 649 ms 56740 KB Output is correct
60 Correct 253 ms 20280 KB Output is correct
61 Correct 590 ms 56740 KB Output is correct
62 Correct 1077 ms 57636 KB Output is correct
63 Correct 937 ms 57376 KB Output is correct
64 Correct 869 ms 57140 KB Output is correct
65 Correct 589 ms 56756 KB Output is correct
66 Correct 952 ms 57116 KB Output is correct
67 Correct 728 ms 57632 KB Output is correct
68 Correct 727 ms 57628 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 1 ms 344 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 344 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 1 ms 344 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 2 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 2 ms 344 KB Output is correct
86 Correct 10 ms 960 KB Output is correct
87 Correct 10 ms 1112 KB Output is correct
88 Correct 9 ms 1112 KB Output is correct
89 Correct 14 ms 960 KB Output is correct
90 Correct 10 ms 1112 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 1 ms 600 KB Output is correct
93 Correct 8 ms 964 KB Output is correct
94 Correct 9 ms 980 KB Output is correct
95 Correct 10 ms 1112 KB Output is correct
96 Correct 9 ms 1112 KB Output is correct
97 Correct 9 ms 1112 KB Output is correct
98 Correct 0 ms 344 KB Output is correct
99 Correct 74 ms 56556 KB Output is correct
100 Correct 88 ms 56728 KB Output is correct
101 Correct 73 ms 57612 KB Output is correct
102 Correct 73 ms 56896 KB Output is correct
103 Correct 68 ms 57108 KB Output is correct
104 Correct 82 ms 57632 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 42 ms 32952 KB Output is correct
107 Correct 72 ms 56852 KB Output is correct
108 Correct 74 ms 57380 KB Output is correct
109 Correct 78 ms 56872 KB Output is correct
110 Correct 68 ms 57016 KB Output is correct
111 Correct 68 ms 57644 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 169 ms 45924 KB Output is correct
4 Correct 1195 ms 57636 KB Output is correct
5 Correct 874 ms 29232 KB Output is correct
6 Correct 1225 ms 57636 KB Output is correct
7 Correct 979 ms 39460 KB Output is correct
8 Correct 1285 ms 57880 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Incorrect 1 ms 344 KB Output isn't correct
22 Halted 0 ms 0 KB -