oj.uz

Submission #553582

# Submission time Handle Problem Language Result Execution time Memory
553582 2022-04-26T09:46:31 Z Jarif_Rahman Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 4000 ms 37944 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;

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

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

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);
    if(h[anc[k][0][nd]] == l) return 1;
    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));

    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 ans = inf;
    for(int i = C; i <= D; i++){
        int mx = -1, in = -1;
        for(int j = B; j >= A; j--){
            if(h[j] > h[i]) break;
            if(h[j] > mx) mx = h[j], in = j;
        }
        if(in == -1) continue;
        int x = get_dis(in, i);
        if(x != -1) ans = min(ans, x);
    }
    if(ans == inf) ans = -1;
    return ans;
}

Subtask #1
0 / 4.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 284 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 4 ms 336 KB Output is correct
13 Correct 5 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 2 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 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 3 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 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 3 ms 336 KB Output is correct
31 Correct 3 ms 208 KB Output is correct
32 Correct 2 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 284 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 4 ms 336 KB Output is correct
13 Correct 5 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 2 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 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 3 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 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 3 ms 336 KB Output is correct
31 Correct 3 ms 208 KB Output is correct
32 Correct 2 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 1 ms 208 KB Output is correct
42 Correct 0 ms 208 KB Output is correct
43 Correct 0 ms 208 KB Output is correct
44 Correct 1 ms 208 KB Output is correct
45 Correct 4 ms 336 KB Output is correct
46 Correct 2 ms 208 KB Output is correct
47 Correct 3 ms 208 KB Output is correct
48 Correct 1 ms 208 KB Output is correct
49 Correct 4 ms 336 KB Output is correct
50 Correct 5 ms 336 KB Output is correct
51 Correct 5 ms 208 KB Output is correct
52 Correct 3 ms 336 KB Output is correct
53 Correct 4 ms 208 KB Output is correct
54 Correct 4 ms 336 KB Output is correct
55 Correct 6 ms 208 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 0 ms 336 KB Output is correct
58 Correct 41 ms 592 KB Output is correct
59 Correct 60 ms 656 KB Output is correct
60 Correct 12 ms 336 KB Output is correct
61 Correct 56 ms 656 KB Output is correct
62 Correct 22 ms 336 KB Output is correct
63 Correct 75 ms 656 KB Output is correct
64 Correct 285 ms 592 KB Output is correct
65 Correct 290 ms 592 KB Output is correct
66 Correct 298 ms 660 KB Output is correct
67 Correct 71 ms 656 KB Output is correct
68 Correct 204 ms 656 KB Output is correct
69 Correct 51 ms 660 KB Output is correct
70 Correct 171 ms 592 KB Output is correct
71 Correct 1 ms 208 KB Output is correct
72 Correct 1 ms 208 KB Output is correct
73 Correct 2 ms 336 KB Output is correct
74 Correct 3 ms 336 KB Output is correct
75 Correct 3 ms 208 KB Output is correct
76 Correct 4 ms 336 KB Output is correct
77 Correct 4 ms 336 KB Output is correct
78 Correct 1 ms 208 KB Output is correct
79 Correct 1 ms 208 KB Output is correct
80 Correct 2 ms 208 KB Output is correct
81 Correct 3 ms 336 KB Output is correct
82 Correct 4 ms 208 KB Output is correct
83 Correct 3 ms 208 KB Output is correct
84 Correct 2 ms 336 KB Output is correct
85 Correct 3 ms 336 KB Output is correct
86 Correct 0 ms 208 KB Output is correct
87 Correct 1 ms 336 KB Output is correct
88 Correct 1 ms 336 KB Output is correct
89 Correct 1 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 1 ms 336 KB Output is correct
92 Correct 1 ms 336 KB Output is correct
93 Correct 1 ms 336 KB Output is correct
94 Correct 3 ms 336 KB Output is correct
95 Correct 18 ms 656 KB Output is correct
96 Correct 18 ms 656 KB Output is correct
97 Correct 23 ms 592 KB Output is correct
98 Correct 21 ms 592 KB Output is correct
99 Correct 26 ms 660 KB Output is correct
100 Correct 0 ms 336 KB Output is correct
101 Correct 2 ms 336 KB Output is correct
102 Correct 19 ms 592 KB Output is correct
103 Correct 10 ms 592 KB Output is correct
104 Correct 11 ms 676 KB Output is correct
105 Correct 19 ms 676 KB Output is correct
106 Correct 21 ms 592 KB Output is correct
107 Correct 0 ms 276 KB Output is correct
108 Correct 1 ms 428 KB Output is correct
109 Correct 1 ms 592 KB Output is correct
110 Correct 3 ms 592 KB Output is correct
111 Correct 1 ms 560 KB Output is correct
112 Correct 1 ms 592 KB Output is correct
113 Correct 3 ms 592 KB Output is correct

Subtask #4
0 / 12.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 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 51 ms 30492 KB Output is correct
6 Correct 71 ms 37872 KB Output is correct
7 Correct 24 ms 19480 KB Output is correct
8 Correct 61 ms 37792 KB Output is correct
9 Correct 11 ms 6084 KB Output is correct
10 Correct 59 ms 37768 KB Output is correct
11 Execution timed out 4027 ms 37896 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.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 1 ms 208 KB Output is correct
4 Correct 263 ms 17452 KB Output is correct
5 Correct 814 ms 37944 KB Output is correct
6 Correct 510 ms 6476 KB Output is correct
7 Correct 911 ms 37788 KB Output is correct
8 Correct 414 ms 13232 KB Output is correct
9 Correct 860 ms 37772 KB Output is correct
10 Correct 956 ms 37900 KB Output is correct
11 Correct 1052 ms 37816 KB Output is correct
12 Correct 1153 ms 37820 KB Output is correct
13 Correct 846 ms 37872 KB Output is correct
14 Correct 987 ms 37844 KB Output is correct
15 Correct 752 ms 37912 KB Output is correct
16 Correct 838 ms 37860 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 2 ms 208 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 18 ms 592 KB Output is correct
28 Correct 18 ms 592 KB Output is correct
29 Correct 18 ms 652 KB Output is correct
30 Correct 18 ms 592 KB Output is correct
31 Correct 17 ms 592 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 27 ms 22068 KB Output is correct
34 Correct 61 ms 37868 KB Output is correct
35 Correct 56 ms 37788 KB Output is correct
36 Correct 46 ms 37776 KB Output is correct
37 Correct 41 ms 37788 KB Output is correct
38 Correct 44 ms 37916 KB Output is correct

Subtask #6
0 / 21.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 1 ms 208 KB Output is correct
4 Correct 263 ms 17452 KB Output is correct
5 Correct 814 ms 37944 KB Output is correct
6 Correct 510 ms 6476 KB Output is correct
7 Correct 911 ms 37788 KB Output is correct
8 Correct 414 ms 13232 KB Output is correct
9 Correct 860 ms 37772 KB Output is correct
10 Correct 956 ms 37900 KB Output is correct
11 Correct 1052 ms 37816 KB Output is correct
12 Correct 1153 ms 37820 KB Output is correct
13 Correct 846 ms 37872 KB Output is correct
14 Correct 987 ms 37844 KB Output is correct
15 Correct 752 ms 37912 KB Output is correct
16 Correct 838 ms 37860 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 2 ms 208 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 18 ms 592 KB Output is correct
28 Correct 18 ms 592 KB Output is correct
29 Correct 18 ms 652 KB Output is correct
30 Correct 18 ms 592 KB Output is correct
31 Correct 17 ms 592 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 27 ms 22068 KB Output is correct
34 Correct 61 ms 37868 KB Output is correct
35 Correct 56 ms 37788 KB Output is correct
36 Correct 46 ms 37776 KB Output is correct
37 Correct 41 ms 37788 KB Output is correct
38 Correct 44 ms 37916 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 1 ms 208 KB Output is correct
42 Correct 195 ms 17472 KB Output is correct
43 Correct 900 ms 37768 KB Output is correct
44 Correct 598 ms 6476 KB Output is correct
45 Correct 816 ms 37772 KB Output is correct
46 Correct 535 ms 13204 KB Output is correct
47 Correct 890 ms 37768 KB Output is correct
48 Correct 1099 ms 37816 KB Output is correct
49 Correct 1040 ms 37848 KB Output is correct
50 Correct 1004 ms 37772 KB Output is correct
51 Correct 767 ms 37844 KB Output is correct
52 Correct 968 ms 37820 KB Output is correct
53 Correct 608 ms 37896 KB Output is correct
54 Correct 608 ms 37876 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Correct 96 ms 37652 KB Output is correct
57 Correct 629 ms 37788 KB Output is correct
58 Correct 477 ms 6852 KB Output is correct
59 Correct 766 ms 37784 KB Output is correct
60 Correct 385 ms 13812 KB Output is correct
61 Correct 793 ms 37820 KB Output is correct
62 Execution timed out 4053 ms 37912 KB Time limit exceeded
63 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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