oj.uz

Submission #553926

# Submission time Handle Problem Language Result Execution time Memory
553926 2022-04-27T10:50:19 Z Jarif_Rahman Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1234 ms 74776 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

struct sparse_table{
    vector<int> lg;
    vector<vector<pair<int, int>>> v;
    sparse_table(vector<int> _v){
        int n = _v.size();
        lg.resize(n+1);
        for(int i = 0; i <= n; i++) lg[i] = log2(i);
        int k = 0, p = 1;
        while(p < n) p*=2, k++;
        k++;
        v = vector<vector<pair<int, int>>>(n, vector<pair<int, int>>(k, make_pair(0, 0)));
        for(int i = 0; i < n; i++) v[i][0] = {_v[i], i};
        for(int p = 1; p < k; p++){
            for(int i = 0; i < n; i++){
                v[i][p] = max(v[i][p], v[i][p-1]);
                if(i + (1<<(p-1)) < n) v[i][p] = max(v[i][p], v[i + (1<<(p-1))][p-1]);
            }
        }
    }
    pair<int, int> query(int a, int b){
        int p = lg[b-a+1];
        return max(v[a][p], v[b-(1<<p)+1][p]);
    }
};

const int K = 21;
const int inf = 1e9;

int n;
vector<int> h;
vector<int> jump[2];
vector<int> anc[2][K];

sparse_table sp({});

template<int k>
int get_anc(int nd, int h){
    for(int i = 0; i < K; i++){
        if(h%2 == 1) nd = anc[k][i][nd];
        h/=2;
    }
    return nd;
}

template<int k>
int binlift(int nd, int l){
    if(h[nd] == l) return 0;
    if(h[nd] > l) return -inf;
    for(int i = K-1; i >= 0; i--) if(h[anc[k][i][nd]] <= l)
        return binlift<k>(anc[k][i][nd], l)+(1<<i);
    return 0;
}

void init(int N, vector<int> H){
    for(int &x: H) x--;
    n = N, h = H;
    h.pb(n);
    fill(jump, jump+2, vector<int>(n, n));
    fill(anc[0], anc[0]+K, vector<int>(n+1, n));
    fill(anc[1], anc[1]+K, vector<int>(n+1, n));

    sp = sparse_table(H);

    stack<int> st;
    for(int i = n-1; i >= 0; i--){
        while(!st.empty() && h[i] > h[st.top()]){
            jump[0][st.top()] = i;
            st.pop();
        }
        st.push(i);
    }
    while(!st.empty()) st.pop();

    for(int i = 0; i < n; i++){
        while(!st.empty() && h[i] > h[st.top()]){
            jump[1][st.top()] = i;
            st.pop();
        }
        st.push(i);
    }
    while(!st.empty()) st.pop();

    for(int i = 0; i < n; i++){
        anc[0][0][i] = h[jump[0][i]] < h[jump[1][i]] ? jump[0][i] : jump[1][i];
        anc[1][0][i] = h[jump[0][i]] > h[jump[1][i]] ? jump[0][i] : jump[1][i];
        if(anc[1][0][i] == n) anc[1][0][i] = anc[0][0][i];
    }

    for(int p = 1; p < K; p++) for(int i = 0; i <= n; i++)
        anc[0][p][i] = anc[0][p-1][anc[0][p-1][i]],
        anc[1][p][i] = anc[1][p-1][anc[1][p-1][i]];
}

int get_dis(int A, int C){
    int ans = binlift<1>(A, h[C]);
    if(ans < 0) return -1;
    int nd = get_anc<1>(A, ans);
    int x = binlift<0>(nd, h[C]);
    if(x < 0) return -1;
    nd = get_anc<0>(nd, x);
    ans+=x;
    if(nd == C) return ans;
    return -1;
}

int minimum_jumps(int A, int B, int C, int D){
    int l = 1, r = B-A+1;
    while(l < r){
        int md = (l+r)/2;
        if(sp.query(B-md+1, B).f > h[C]) r = md;
        else l = md+1;
    }
    int S = A;
    if(sp.query(B-l+1, B).f > h[C]){
        S = B-l+2;
        if(S > B) return -1;
    }
    S = sp.query(S, B).sc;
    return get_dis(S, C);
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 204 ms 59424 KB Output is correct
4 Correct 1234 ms 74660 KB Output is correct
5 Correct 1012 ms 37652 KB Output is correct
6 Correct 1150 ms 74700 KB Output is correct
7 Correct 886 ms 51120 KB Output is correct
8 Correct 1202 ms 74680 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 267 ms 34288 KB Output is correct
5 Correct 989 ms 74656 KB Output is correct
6 Correct 490 ms 11980 KB Output is correct
7 Correct 869 ms 74776 KB Output is correct
8 Correct 558 ms 25920 KB Output is correct
9 Correct 962 ms 74652 KB Output is correct
10 Correct 1115 ms 74664 KB Output is correct
11 Correct 1140 ms 74660 KB Output is correct
12 Correct 1032 ms 74660 KB Output is correct
13 Correct 987 ms 74600 KB Output is correct
14 Correct 1032 ms 74552 KB Output is correct
15 Correct 898 ms 74680 KB Output is correct
16 Correct 782 ms 74664 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 3 ms 208 KB Output is correct
20 Correct 3 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 3 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 18 ms 848 KB Output is correct
28 Correct 21 ms 848 KB Output is correct
29 Correct 17 ms 848 KB Output is correct
30 Correct 22 ms 848 KB Output is correct
31 Correct 16 ms 848 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 70 ms 43316 KB Output is correct
34 Correct 120 ms 74552 KB Output is correct
35 Correct 124 ms 74632 KB Output is correct
36 Correct 115 ms 74552 KB Output is correct
37 Correct 113 ms 74660 KB Output is correct
38 Correct 115 ms 74676 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 267 ms 34288 KB Output is correct
5 Correct 989 ms 74656 KB Output is correct
6 Correct 490 ms 11980 KB Output is correct
7 Correct 869 ms 74776 KB Output is correct
8 Correct 558 ms 25920 KB Output is correct
9 Correct 962 ms 74652 KB Output is correct
10 Correct 1115 ms 74664 KB Output is correct
11 Correct 1140 ms 74660 KB Output is correct
12 Correct 1032 ms 74660 KB Output is correct
13 Correct 987 ms 74600 KB Output is correct
14 Correct 1032 ms 74552 KB Output is correct
15 Correct 898 ms 74680 KB Output is correct
16 Correct 782 ms 74664 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 3 ms 208 KB Output is correct
20 Correct 3 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 3 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 18 ms 848 KB Output is correct
28 Correct 21 ms 848 KB Output is correct
29 Correct 17 ms 848 KB Output is correct
30 Correct 22 ms 848 KB Output is correct
31 Correct 16 ms 848 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 70 ms 43316 KB Output is correct
34 Correct 120 ms 74552 KB Output is correct
35 Correct 124 ms 74632 KB Output is correct
36 Correct 115 ms 74552 KB Output is correct
37 Correct 113 ms 74660 KB Output is correct
38 Correct 115 ms 74676 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 253 ms 34292 KB Output is correct
43 Correct 901 ms 74680 KB Output is correct
44 Correct 631 ms 11980 KB Output is correct
45 Correct 947 ms 74660 KB Output is correct
46 Correct 539 ms 25792 KB Output is correct
47 Correct 797 ms 74664 KB Output is correct
48 Correct 1072 ms 74656 KB Output is correct
49 Correct 1158 ms 74572 KB Output is correct
50 Correct 1160 ms 74656 KB Output is correct
51 Correct 967 ms 74660 KB Output is correct
52 Correct 1097 ms 74640 KB Output is correct
53 Correct 819 ms 74708 KB Output is correct
54 Correct 790 ms 74696 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Correct 169 ms 74364 KB Output is correct
57 Correct 1016 ms 74636 KB Output is correct
58 Correct 366 ms 12740 KB Output is correct
59 Correct 914 ms 74636 KB Output is correct
60 Correct 408 ms 26588 KB Output is correct
61 Correct 1014 ms 74552 KB Output is correct
62 Correct 1194 ms 74680 KB Output is correct
63 Correct 1134 ms 74652 KB Output is correct
64 Correct 1160 ms 74664 KB Output is correct
65 Correct 892 ms 74664 KB Output is correct
66 Correct 1175 ms 74656 KB Output is correct
67 Correct 832 ms 74704 KB Output is correct
68 Correct 859 ms 74640 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 1 ms 208 KB Output is correct
71 Correct 2 ms 336 KB Output is correct
72 Correct 2 ms 336 KB Output is correct
73 Correct 2 ms 336 KB Output is correct
74 Correct 2 ms 336 KB Output is correct
75 Correct 2 ms 336 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 0 ms 208 KB Output is correct
78 Correct 1 ms 208 KB Output is correct
79 Correct 2 ms 336 KB Output is correct
80 Correct 4 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 2 ms 336 KB Output is correct
84 Correct 0 ms 336 KB Output is correct
85 Correct 3 ms 336 KB Output is correct
86 Correct 16 ms 932 KB Output is correct
87 Correct 10 ms 848 KB Output is correct
88 Correct 16 ms 948 KB Output is correct
89 Correct 18 ms 848 KB Output is correct
90 Correct 18 ms 848 KB Output is correct
91 Correct 0 ms 336 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 10 ms 948 KB Output is correct
94 Correct 17 ms 848 KB Output is correct
95 Correct 21 ms 928 KB Output is correct
96 Correct 21 ms 848 KB Output is correct
97 Correct 19 ms 848 KB Output is correct
98 Correct 1 ms 208 KB Output is correct
99 Correct 118 ms 74556 KB Output is correct
100 Correct 120 ms 74680 KB Output is correct
101 Correct 113 ms 74660 KB Output is correct
102 Correct 125 ms 74652 KB Output is correct
103 Correct 132 ms 74764 KB Output is correct
104 Correct 115 ms 74712 KB Output is correct
105 Correct 1 ms 208 KB Output is correct
106 Correct 77 ms 43292 KB Output is correct
107 Correct 148 ms 74648 KB Output is correct
108 Correct 121 ms 74636 KB Output is correct
109 Correct 122 ms 74652 KB Output is correct
110 Correct 111 ms 74624 KB Output is correct
111 Correct 112 ms 74752 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 204 ms 59424 KB Output is correct
4 Correct 1234 ms 74660 KB Output is correct
5 Correct 1012 ms 37652 KB Output is correct
6 Correct 1150 ms 74700 KB Output is correct
7 Correct 886 ms 51120 KB Output is correct
8 Correct 1202 ms 74680 KB Output is correct
9 Incorrect 0 ms 208 KB Output isn't correct
10 Halted 0 ms 0 KB -