oj.uz

Submission #980598

# Submission time Handle Problem Language Result Execution time Memory
980598 2024-05-12T09:11:13 Z vjudge1 Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 4000 ms 39704 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;

struct Segtree{
  vector<int> t;
  int n;
  void init(int _n){
    n = _n;
    t.resize(2 * n);
  }
  int merge(const int &a, const int &b){
    return max(a, b);
  }
  void build(vector<int> &a){
    init(len(a));
    for(int i = 0; i < n; i ++) t[i + n] = a[i];
    for(int i = n - 1; i > 0; i --) t[i] = merge(t[i << 1], t[i << 1 | 1]);
  }

  int get(int l, int r){
    l += n; r += n;
    int res = -1;
    while(l <= r){
      if(l % 2) res = merge(res, t[l ++]);
      if(r % 2 == 0) res = merge(res, t[r --]);
      l /= 2; r /= 2;
    }
    return res;
  }
} t;

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



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);
    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 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 4058 ms 31580 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 0 ms 344 KB Output is correct
4 Correct 1 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 0 ms 344 KB Output is correct
4 Correct 1 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 1 ms 344 KB Output is correct
5 Correct 37 ms 31136 KB Output is correct
6 Correct 45 ms 38700 KB Output is correct
7 Correct 23 ms 19956 KB Output is correct
8 Correct 51 ms 38768 KB Output is correct
9 Correct 6 ms 5976 KB Output is correct
10 Correct 45 ms 38824 KB Output is correct
11 Correct 161 ms 39640 KB Output is correct
12 Correct 333 ms 39188 KB Output is correct
13 Correct 80 ms 39204 KB Output is correct
14 Correct 48 ms 38692 KB Output is correct
15 Correct 115 ms 39192 KB Output is correct
16 Correct 69 ms 39464 KB Output is correct
17 Correct 98 ms 39504 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Incorrect 1 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 152 ms 17844 KB Output is correct
5 Correct 612 ms 38816 KB Output is correct
6 Correct 414 ms 6612 KB Output is correct
7 Correct 639 ms 38820 KB Output is correct
8 Correct 352 ms 13500 KB Output is correct
9 Correct 646 ms 39076 KB Output is correct
10 Correct 818 ms 39468 KB Output is correct
11 Correct 731 ms 39476 KB Output is correct
12 Correct 750 ms 39356 KB Output is correct
13 Correct 612 ms 38836 KB Output is correct
14 Correct 808 ms 39224 KB Output is correct
15 Correct 644 ms 39416 KB Output is correct
16 Correct 590 ms 39644 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 344 KB Output is correct
27 Correct 9 ms 820 KB Output is correct
28 Correct 9 ms 856 KB Output is correct
29 Correct 8 ms 856 KB Output is correct
30 Correct 12 ms 856 KB Output is correct
31 Correct 10 ms 840 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 33 ms 22744 KB Output is correct
34 Correct 50 ms 38708 KB Output is correct
35 Correct 37 ms 39432 KB Output is correct
36 Correct 50 ms 38840 KB Output is correct
37 Correct 49 ms 39244 KB Output is correct
38 Correct 40 ms 39704 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 152 ms 17844 KB Output is correct
5 Correct 612 ms 38816 KB Output is correct
6 Correct 414 ms 6612 KB Output is correct
7 Correct 639 ms 38820 KB Output is correct
8 Correct 352 ms 13500 KB Output is correct
9 Correct 646 ms 39076 KB Output is correct
10 Correct 818 ms 39468 KB Output is correct
11 Correct 731 ms 39476 KB Output is correct
12 Correct 750 ms 39356 KB Output is correct
13 Correct 612 ms 38836 KB Output is correct
14 Correct 808 ms 39224 KB Output is correct
15 Correct 644 ms 39416 KB Output is correct
16 Correct 590 ms 39644 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 344 KB Output is correct
27 Correct 9 ms 820 KB Output is correct
28 Correct 9 ms 856 KB Output is correct
29 Correct 8 ms 856 KB Output is correct
30 Correct 12 ms 856 KB Output is correct
31 Correct 10 ms 840 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 33 ms 22744 KB Output is correct
34 Correct 50 ms 38708 KB Output is correct
35 Correct 37 ms 39432 KB Output is correct
36 Correct 50 ms 38840 KB Output is correct
37 Correct 49 ms 39244 KB Output is correct
38 Correct 40 ms 39704 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 130 ms 17844 KB Output is correct
43 Correct 660 ms 38836 KB Output is correct
44 Correct 430 ms 6836 KB Output is correct
45 Correct 615 ms 38820 KB Output is correct
46 Correct 352 ms 13496 KB Output is correct
47 Correct 640 ms 38836 KB Output is correct
48 Correct 800 ms 39648 KB Output is correct
49 Correct 674 ms 39528 KB Output is correct
50 Correct 740 ms 39444 KB Output is correct
51 Correct 590 ms 38828 KB Output is correct
52 Correct 729 ms 39216 KB Output is correct
53 Correct 619 ms 39604 KB Output is correct
54 Correct 600 ms 39468 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 70 ms 38468 KB Output is correct
57 Correct 660 ms 38832 KB Output is correct
58 Correct 291 ms 7116 KB Output is correct
59 Correct 605 ms 38720 KB Output is correct
60 Correct 250 ms 13888 KB Output is correct
61 Correct 620 ms 38832 KB Output is correct
62 Correct 935 ms 39452 KB Output is correct
63 Correct 867 ms 39216 KB Output is correct
64 Correct 822 ms 39228 KB Output is correct
65 Correct 627 ms 39008 KB Output is correct
66 Correct 781 ms 39220 KB Output is correct
67 Correct 698 ms 39476 KB Output is correct
68 Correct 612 ms 39624 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 1 ms 344 KB Output is correct
86 Correct 10 ms 856 KB Output is correct
87 Correct 11 ms 856 KB Output is correct
88 Correct 8 ms 812 KB Output is correct
89 Correct 10 ms 856 KB Output is correct
90 Correct 10 ms 828 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 1 ms 344 KB Output is correct
93 Correct 9 ms 856 KB Output is correct
94 Correct 9 ms 832 KB Output is correct
95 Correct 9 ms 856 KB Output is correct
96 Correct 8 ms 824 KB Output is correct
97 Correct 9 ms 600 KB Output is correct
98 Correct 0 ms 344 KB Output is correct
99 Correct 45 ms 38584 KB Output is correct
100 Correct 41 ms 38872 KB Output is correct
101 Correct 39 ms 39608 KB Output is correct
102 Correct 40 ms 38840 KB Output is correct
103 Correct 39 ms 39208 KB Output is correct
104 Correct 36 ms 39624 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 24 ms 22692 KB Output is correct
107 Correct 41 ms 38820 KB Output is correct
108 Correct 41 ms 39656 KB Output is correct
109 Correct 42 ms 38836 KB Output is correct
110 Correct 37 ms 39208 KB Output is correct
111 Correct 36 ms 39660 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 4058 ms 31580 KB Time limit exceeded
4 Halted 0 ms 0 KB -