oj.uz

Submission #980618

# Submission time Handle Problem Language Result Execution time Memory
980618 2024-05-12T09:23:31 Z vjudge1 Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 4000 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 L, int R) {
    if(sub1) return L - B;
    int obst = t.get(B, L - 1);
    int mn = inf;

    for(int C = L; C <= R; C ++){
      if(h[C] <= obst) continue;
      int l = A - 1, r = B;
      while(r - l > 1){
        int m = (l + r) / 2;
        if(t.get(m, C - 1) < h[C]){
          r = m;
        }else l = m;
      }
      int st = t.get(r, B);
      int ans = 0;
      for(int j = logn - 1; j >= 0; j --){
        if(up[j][st] != -1 && up[j][st] <= h[C]){
          st = up[j][st];
          ans += 1 << j;
        }
      }

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

    return (mn == inf ? -1 : mn);
}

Subtask #1
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 Execution timed out 4043 ms 45860 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.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 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 1 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.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 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 1 ms 344 KB Output isn't correct
6 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 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 57 ms 45744 KB Output is correct
6 Correct 81 ms 56752 KB Output is correct
7 Correct 34 ms 29092 KB Output is correct
8 Correct 73 ms 56756 KB Output is correct
9 Correct 9 ms 8736 KB Output is correct
10 Correct 71 ms 56856 KB Output is correct
11 Correct 95 ms 57632 KB Output is correct
12 Correct 127 ms 57268 KB Output is correct
13 Correct 80 ms 57352 KB Output is correct
14 Correct 71 ms 56752 KB Output is correct
15 Correct 86 ms 57252 KB Output is correct
16 Correct 93 ms 57584 KB Output is correct
17 Correct 101 ms 57380 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Incorrect 0 ms 344 KB Output isn't correct
21 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 143 ms 26044 KB Output is correct
5 Correct 650 ms 56760 KB Output is correct
6 Correct 399 ms 9680 KB Output is correct
7 Correct 627 ms 56740 KB Output is correct
8 Correct 380 ms 19784 KB Output is correct
9 Correct 673 ms 56860 KB Output is correct
10 Correct 788 ms 57640 KB Output is correct
11 Correct 775 ms 57572 KB Output is correct
12 Correct 796 ms 57476 KB Output is correct
13 Correct 648 ms 56860 KB Output is correct
14 Correct 763 ms 57128 KB Output is correct
15 Correct 609 ms 57624 KB Output is correct
16 Correct 700 ms 57460 KB Output is correct
17 Correct 1 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 11 ms 1112 KB Output is correct
28 Correct 13 ms 976 KB Output is correct
29 Correct 10 ms 964 KB Output is correct
30 Correct 12 ms 1104 KB Output is correct
31 Correct 8 ms 856 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 40 ms 33048 KB Output is correct
34 Correct 71 ms 56732 KB Output is correct
35 Correct 68 ms 57296 KB Output is correct
36 Correct 78 ms 56732 KB Output is correct
37 Correct 67 ms 57132 KB Output is correct
38 Correct 67 ms 57524 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 143 ms 26044 KB Output is correct
5 Correct 650 ms 56760 KB Output is correct
6 Correct 399 ms 9680 KB Output is correct
7 Correct 627 ms 56740 KB Output is correct
8 Correct 380 ms 19784 KB Output is correct
9 Correct 673 ms 56860 KB Output is correct
10 Correct 788 ms 57640 KB Output is correct
11 Correct 775 ms 57572 KB Output is correct
12 Correct 796 ms 57476 KB Output is correct
13 Correct 648 ms 56860 KB Output is correct
14 Correct 763 ms 57128 KB Output is correct
15 Correct 609 ms 57624 KB Output is correct
16 Correct 700 ms 57460 KB Output is correct
17 Correct 1 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 11 ms 1112 KB Output is correct
28 Correct 13 ms 976 KB Output is correct
29 Correct 10 ms 964 KB Output is correct
30 Correct 12 ms 1104 KB Output is correct
31 Correct 8 ms 856 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 40 ms 33048 KB Output is correct
34 Correct 71 ms 56732 KB Output is correct
35 Correct 68 ms 57296 KB Output is correct
36 Correct 78 ms 56732 KB Output is correct
37 Correct 67 ms 57132 KB Output is correct
38 Correct 67 ms 57524 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 163 ms 26044 KB Output is correct
43 Correct 599 ms 56868 KB Output is correct
44 Correct 439 ms 9652 KB Output is correct
45 Correct 685 ms 56868 KB Output is correct
46 Correct 376 ms 19784 KB Output is correct
47 Correct 616 ms 56756 KB Output is correct
48 Correct 825 ms 57636 KB Output is correct
49 Correct 691 ms 57372 KB Output is correct
50 Correct 795 ms 57364 KB Output is correct
51 Correct 649 ms 56640 KB Output is correct
52 Correct 733 ms 57024 KB Output is correct
53 Correct 630 ms 57880 KB Output is correct
54 Correct 678 ms 57632 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 112 ms 56736 KB Output is correct
57 Correct 644 ms 56740 KB Output is correct
58 Correct 305 ms 10188 KB Output is correct
59 Correct 635 ms 56740 KB Output is correct
60 Correct 251 ms 20288 KB Output is correct
61 Correct 652 ms 56744 KB Output is correct
62 Correct 1002 ms 57876 KB Output is correct
63 Correct 959 ms 57384 KB Output is correct
64 Correct 890 ms 57352 KB Output is correct
65 Correct 680 ms 56640 KB Output is correct
66 Correct 988 ms 57120 KB Output is correct
67 Correct 811 ms 57640 KB Output is correct
68 Correct 647 ms 57628 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 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 0 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 1 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 8 ms 856 KB Output is correct
87 Correct 9 ms 976 KB Output is correct
88 Correct 8 ms 1112 KB Output is correct
89 Correct 10 ms 952 KB Output is correct
90 Correct 9 ms 976 KB Output is correct
91 Correct 0 ms 340 KB Output is correct
92 Correct 1 ms 600 KB Output is correct
93 Correct 8 ms 1112 KB Output is correct
94 Correct 10 ms 1112 KB Output is correct
95 Correct 8 ms 856 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 80 ms 56496 KB Output is correct
100 Correct 72 ms 56640 KB Output is correct
101 Correct 68 ms 57452 KB Output is correct
102 Correct 70 ms 56732 KB Output is correct
103 Correct 67 ms 57128 KB Output is correct
104 Correct 70 ms 57524 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 36 ms 33188 KB Output is correct
107 Correct 73 ms 56760 KB Output is correct
108 Correct 68 ms 57536 KB Output is correct
109 Correct 82 ms 56752 KB Output is correct
110 Correct 70 ms 57264 KB Output is correct
111 Correct 67 ms 57636 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 Execution timed out 4043 ms 45860 KB Time limit exceeded
4 Halted 0 ms 0 KB -