oj.uz

Submission #968781

# Submission time Handle Problem Language Result Execution time Memory
968781 2024-04-24T04:25:57 Z steveonalex Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1188 ms 44248 KB 
#include <bits/stdc++.h>
#include "jumps.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int INF = 1e9;
struct SegmentTree{
    int n;
    vector<int> a;

    SegmentTree(){}
    SegmentTree(int _n){
        n = _n;
        a.resize(n * 2 + 2, -INF);
    }

    void update(int i, int v){
        i += n; if (!maximize(a[i], v)) return;
        while(i > 1){
            i >>= 1;
            a[i] = max(a[i * 2], a[i * 2 + 1]);
        }
    }

    int get(int l, int r){
        l += n; r += n + 1;
        int ans = -INF;
        while(l < r){
            if (l & 1) maximize(ans, a[l++]);
            if (r & 1) maximize(ans, a[--r]);
            l >>= 1; r >>= 1;
        }
        return ans;
    }
};
 
 
const int LOG_N = 18;
const int N = 2e5 + 69;
int n;
int h[N], pref[N], suff[N];
int nxt[LOG_N][N], lnxt[LOG_N][N];
SegmentTree segg;
map<int, int> pos;

void init(int _n, vector<int> H) {
    n = _n;
    for(int i = 0; i<n; ++i) h[i] = H[i];
 
    vector<int> st;
    for(int i = 0; i<n; ++i){
        while(st.size() && h[st.back()] <= h[i]) st.pop_back();
        if (st.empty()) pref[i] = n;
        else pref[i] = st.back();
        st.push_back(i);
    }
    st.clear();
    for(int i = n-1; i>=0; --i){
        while(st.size() && h[st.back()] <= h[i]) st.pop_back();
        if (st.empty()) suff[i] = n;
        else suff[i] = st.back();
        st.push_back(i);
    }
 
    for(int i = 0; i<n; ++i){
        if (h[pref[i]] > h[suff[i]]) nxt[0][i] = pref[i];
        else nxt[0][i] = suff[i];
        lnxt[0][i] = suff[i];
    }
    lnxt[0][n] = nxt[0][n] = n;
 
    for(int j = 1; j < LOG_N; ++j){
        for(int i = 0; i<=n; ++i){
            nxt[j][i] = nxt[j-1][nxt[j-1][i]];
            lnxt[j][i]= lnxt[j-1][lnxt[j-1][i]];
        }
    }

    segg = SegmentTree(n);
    for(int i = 0;i<n; ++i) segg.update(i + 1, H[i]);

    for(int i = 0; i<n; ++i) pos[H[i]] = i;
}
 
int minimum_jumps(int A, int B, int C, int D) {

    int val_between = segg.get(B + 2, C);
    int val_r = segg.get(C + 1, D + 1);

    if (val_r < val_between) return -1;

    int R = val_r;
    int l = C, r = D;
    while(l < r){
        int mid = (l + r) >> 1;
        if (segg.get(C + 1, mid + 1) > val_between) r = mid;
        else l = mid + 1;
    }
    int L = h[l];

    l = A, r = B + 1;
    while(l < r){
        int mid = (l + r) >> 1;
        if (segg.get(mid+1, B+1) > R) l = mid + 1;
        else r = mid;
    }
    if (l > B) return -1;

    int val = segg.get(l + 1, B + 1);
    int x = pos[val];
    int ans = 0;
    for(int j = LOG_N - 1; j>=0; --j){
        if (nxt[j][x] == n) continue;
        if (h[nxt[j][x]] < L) {
            x = nxt[j][x]; 
            ans += MASK(j);
        }
    }
 
    for(int j= LOG_N - 1; j>=0; --j){
        if (lnxt[j][x] < C) {
            x = lnxt[j][x];
            ans += MASK(j);
        }
    }
    x = lnxt[0][x];
    if (x > D) return -1;
    ans++;
 
    return ans;
}
 
 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
//     int n; cin >> n;
//     vector<int> h(n);
//     for(int i = 0; i<n;++i) cin >> h[i];
 
//     init(n, h);
//     int q; cin >> q;
//     for(int i = 0; i<q; ++i){
//         int a, b, c, d; cin >> a >> b >> c >> d;
//         cout << minimum_jumps(a, b, c, d) << "\n";
//     }
 
//     return 0;
// }

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 29016 KB Output is correct
2 Correct 3 ms 29016 KB Output is correct
3 Correct 177 ms 41120 KB Output is correct
4 Correct 1129 ms 44100 KB Output is correct
5 Correct 971 ms 36760 KB Output is correct
6 Correct 1188 ms 44228 KB Output is correct
7 Correct 809 ms 39368 KB Output is correct
8 Correct 1116 ms 44156 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 29016 KB Output is correct
2 Correct 3 ms 29016 KB Output is correct
3 Correct 4 ms 29016 KB Output is correct
4 Correct 3 ms 29152 KB Output is correct
5 Correct 73 ms 40500 KB Output is correct
6 Correct 99 ms 43268 KB Output is correct
7 Correct 52 ms 36544 KB Output is correct
8 Correct 98 ms 43332 KB Output is correct
9 Correct 14 ms 31320 KB Output is correct
10 Correct 100 ms 43456 KB Output is correct
11 Correct 64 ms 44100 KB Output is correct
12 Correct 62 ms 43844 KB Output is correct
13 Incorrect 63 ms 44000 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 6 ms 29016 KB Output is correct
2 Correct 5 ms 29172 KB Output is correct
3 Correct 3 ms 29016 KB Output is correct
4 Correct 183 ms 35628 KB Output is correct
5 Correct 640 ms 43464 KB Output is correct
6 Correct 432 ms 31576 KB Output is correct
7 Correct 674 ms 43456 KB Output is correct
8 Correct 382 ms 33996 KB Output is correct
9 Correct 777 ms 43380 KB Output is correct
10 Correct 907 ms 44212 KB Output is correct
11 Correct 877 ms 44100 KB Output is correct
12 Correct 905 ms 44060 KB Output is correct
13 Correct 651 ms 43312 KB Output is correct
14 Correct 854 ms 43720 KB Output is correct
15 Correct 618 ms 44172 KB Output is correct
16 Correct 663 ms 44096 KB Output is correct
17 Correct 4 ms 29016 KB Output is correct
18 Correct 3 ms 29016 KB Output is correct
19 Correct 4 ms 29016 KB Output is correct
20 Correct 5 ms 29016 KB Output is correct
21 Correct 4 ms 29016 KB Output is correct
22 Correct 5 ms 29016 KB Output is correct
23 Correct 4 ms 29016 KB Output is correct
24 Correct 4 ms 29016 KB Output is correct
25 Correct 4 ms 29016 KB Output is correct
26 Correct 4 ms 29016 KB Output is correct
27 Correct 14 ms 29272 KB Output is correct
28 Correct 15 ms 29272 KB Output is correct
29 Correct 12 ms 29272 KB Output is correct
30 Correct 13 ms 29272 KB Output is correct
31 Correct 12 ms 29272 KB Output is correct
32 Correct 3 ms 29016 KB Output is correct
33 Correct 54 ms 37272 KB Output is correct
34 Correct 104 ms 43472 KB Output is correct
35 Correct 69 ms 44096 KB Output is correct
36 Correct 93 ms 43368 KB Output is correct
37 Correct 67 ms 43848 KB Output is correct
38 Correct 59 ms 44104 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29016 KB Output is correct
2 Correct 5 ms 29172 KB Output is correct
3 Correct 3 ms 29016 KB Output is correct
4 Correct 183 ms 35628 KB Output is correct
5 Correct 640 ms 43464 KB Output is correct
6 Correct 432 ms 31576 KB Output is correct
7 Correct 674 ms 43456 KB Output is correct
8 Correct 382 ms 33996 KB Output is correct
9 Correct 777 ms 43380 KB Output is correct
10 Correct 907 ms 44212 KB Output is correct
11 Correct 877 ms 44100 KB Output is correct
12 Correct 905 ms 44060 KB Output is correct
13 Correct 651 ms 43312 KB Output is correct
14 Correct 854 ms 43720 KB Output is correct
15 Correct 618 ms 44172 KB Output is correct
16 Correct 663 ms 44096 KB Output is correct
17 Correct 4 ms 29016 KB Output is correct
18 Correct 3 ms 29016 KB Output is correct
19 Correct 4 ms 29016 KB Output is correct
20 Correct 5 ms 29016 KB Output is correct
21 Correct 4 ms 29016 KB Output is correct
22 Correct 5 ms 29016 KB Output is correct
23 Correct 4 ms 29016 KB Output is correct
24 Correct 4 ms 29016 KB Output is correct
25 Correct 4 ms 29016 KB Output is correct
26 Correct 4 ms 29016 KB Output is correct
27 Correct 14 ms 29272 KB Output is correct
28 Correct 15 ms 29272 KB Output is correct
29 Correct 12 ms 29272 KB Output is correct
30 Correct 13 ms 29272 KB Output is correct
31 Correct 12 ms 29272 KB Output is correct
32 Correct 3 ms 29016 KB Output is correct
33 Correct 54 ms 37272 KB Output is correct
34 Correct 104 ms 43472 KB Output is correct
35 Correct 69 ms 44096 KB Output is correct
36 Correct 93 ms 43368 KB Output is correct
37 Correct 67 ms 43848 KB Output is correct
38 Correct 59 ms 44104 KB Output is correct
39 Correct 3 ms 29016 KB Output is correct
40 Correct 4 ms 29016 KB Output is correct
41 Correct 3 ms 29016 KB Output is correct
42 Correct 184 ms 35584 KB Output is correct
43 Correct 655 ms 43328 KB Output is correct
44 Correct 413 ms 31636 KB Output is correct
45 Correct 649 ms 43344 KB Output is correct
46 Correct 351 ms 33996 KB Output is correct
47 Correct 667 ms 43432 KB Output is correct
48 Correct 935 ms 44092 KB Output is correct
49 Correct 944 ms 44216 KB Output is correct
50 Correct 908 ms 44104 KB Output is correct
51 Correct 697 ms 43416 KB Output is correct
52 Correct 898 ms 43828 KB Output is correct
53 Correct 639 ms 44088 KB Output is correct
54 Correct 686 ms 44192 KB Output is correct
55 Correct 3 ms 29012 KB Output is correct
56 Correct 132 ms 43376 KB Output is correct
57 Correct 744 ms 43372 KB Output is correct
58 Correct 356 ms 31564 KB Output is correct
59 Correct 692 ms 43328 KB Output is correct
60 Correct 252 ms 34268 KB Output is correct
61 Correct 676 ms 43392 KB Output is correct
62 Correct 1102 ms 44216 KB Output is correct
63 Correct 1035 ms 44100 KB Output is correct
64 Correct 953 ms 43848 KB Output is correct
65 Correct 695 ms 43312 KB Output is correct
66 Correct 973 ms 43848 KB Output is correct
67 Correct 798 ms 44096 KB Output is correct
68 Correct 701 ms 44080 KB Output is correct
69 Correct 3 ms 29016 KB Output is correct
70 Correct 4 ms 29016 KB Output is correct
71 Correct 4 ms 29016 KB Output is correct
72 Correct 4 ms 29016 KB Output is correct
73 Correct 4 ms 29016 KB Output is correct
74 Correct 4 ms 29268 KB Output is correct
75 Correct 4 ms 29168 KB Output is correct
76 Correct 3 ms 29012 KB Output is correct
77 Correct 4 ms 29016 KB Output is correct
78 Correct 5 ms 29016 KB Output is correct
79 Correct 4 ms 29016 KB Output is correct
80 Correct 4 ms 29016 KB Output is correct
81 Correct 4 ms 29016 KB Output is correct
82 Correct 4 ms 29016 KB Output is correct
83 Correct 4 ms 29016 KB Output is correct
84 Correct 3 ms 29016 KB Output is correct
85 Correct 5 ms 29016 KB Output is correct
86 Correct 12 ms 29204 KB Output is correct
87 Correct 15 ms 29272 KB Output is correct
88 Correct 12 ms 29272 KB Output is correct
89 Correct 14 ms 29272 KB Output is correct
90 Correct 17 ms 29272 KB Output is correct
91 Correct 4 ms 29016 KB Output is correct
92 Correct 4 ms 29016 KB Output is correct
93 Correct 14 ms 29272 KB Output is correct
94 Correct 17 ms 29272 KB Output is correct
95 Correct 12 ms 29272 KB Output is correct
96 Correct 12 ms 29272 KB Output is correct
97 Correct 13 ms 29272 KB Output is correct
98 Correct 4 ms 29016 KB Output is correct
99 Correct 115 ms 43304 KB Output is correct
100 Correct 96 ms 43456 KB Output is correct
101 Correct 61 ms 44088 KB Output is correct
102 Correct 86 ms 43376 KB Output is correct
103 Correct 59 ms 43824 KB Output is correct
104 Correct 67 ms 44052 KB Output is correct
105 Correct 4 ms 29016 KB Output is correct
106 Correct 50 ms 37296 KB Output is correct
107 Correct 96 ms 43488 KB Output is correct
108 Correct 60 ms 44088 KB Output is correct
109 Correct 85 ms 43472 KB Output is correct
110 Correct 68 ms 43828 KB Output is correct
111 Correct 62 ms 44248 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 29016 KB Output is correct
2 Correct 3 ms 29016 KB Output is correct
3 Correct 177 ms 41120 KB Output is correct
4 Correct 1129 ms 44100 KB Output is correct
5 Correct 971 ms 36760 KB Output is correct
6 Correct 1188 ms 44228 KB Output is correct
7 Correct 809 ms 39368 KB Output is correct
8 Correct 1116 ms 44156 KB Output is correct
9 Correct 4 ms 29016 KB Output is correct
10 Correct 3 ms 29016 KB Output is correct
11 Correct 3 ms 29128 KB Output is correct
12 Correct 3 ms 29016 KB Output is correct
13 Correct 4 ms 29164 KB Output is correct
14 Correct 4 ms 29016 KB Output is correct
15 Correct 4 ms 29016 KB Output is correct
16 Correct 4 ms 29012 KB Output is correct
17 Correct 4 ms 29016 KB Output is correct
18 Correct 4 ms 29016 KB Output is correct
19 Correct 4 ms 29016 KB Output is correct
20 Correct 4 ms 29016 KB Output is correct
21 Incorrect 5 ms 29288 KB Output isn't correct
22 Halted 0 ms 0 KB -