oj.uz

Submission #981594

# Submission time Handle Problem Language Result Execution time Memory
981594 2024-05-13T11:23:18 Z Ghulam_Junaid Rainforest Jumps (APIO21_jumps) C++17
24 / 100
 2394 ms 570384 KB 
#include <bits/stdc++.h>
#include "jumps.h"

using namespace std;

const int MXN = 2e5 + 10;
const int T = 330;

int n, pos[MXN], to_left[MXN], to_right[MXN], dp[MXN][T + 1], dp_right[MXN][T + 1];
vector<int> seg[4 * MXN], h;
bool subtask1 = 1;

void build(int v = 1, int s = 0, int e = n){
    if (e - s == 1){
        seg[v] = {h[s]};
        return;
    }

    int mid = (s + e) / 2, lc = 2 * v, rc = lc + 1;

    build(lc, s, mid);
    build(rc, mid, e);

    seg[v] = seg[lc];
    for (int x : seg[rc])
        seg[v].push_back(x);

    sort(seg[v].begin(), seg[v].end());
}

int get(int l, int r, int x, int v = 1, int s = 0, int e = n){
    // int mx = -1;
    // for (int i = l; i < r; i ++)
    //     if (h[i] < x)
    //         mx = max(mx, h[i]);
    // return mx;

    if (e <= l || r <= s) return -1;
    if (l <= s && e <= r){
        if (x > seg[v].back())
            return seg[v].back();
        if (x <= seg[v][0])
            return -1;

        int lb = lower_bound(seg[v].begin(), seg[v].end(), x) - seg[v].begin();
        return seg[v][lb - 1];
    }

    int mid = (s + e) / 2, lc = 2 * v, rc = lc + 1;

    return max(get(l, r, x, lc, s, mid), get(l, r, x, rc, mid, e));
}

void init(int N, vector<int> H) {
    n = N;
    h = H;

    for (int i = 0; i < n; i ++)
        pos[h[i]] = i, subtask1 &= (h[i] == (i + 1));

    build();

    stack<int> S;
    for (int i = 0; i < n; i ++){
        while(S.size() and h[S.top()] <= h[i])
            S.pop();

        if (S.size())
            to_left[i] = S.top();
        else
            to_left[i] = i;
        
        S.push(i);
    }

    while (S.size())
        S.pop();

    for (int i = n - 1; i >= 0; i --){
        while (S.size() and h[S.top()] <= h[i])
            S.pop();

        if (S.size())
            to_right[i] = S.top();
        else
            to_right[i] = i;

        S.push(i);
    }

    // for (int i = 0; i < n; i ++){
    //     to_left[i] = to_right[i] = i;
    //     for (int j = i + 1; j < n; j ++){
    //         if (h[j] > h[i]){
    //             to_right[i] = j;
    //             break;
    //         }
    //     }
    //     for (int j = i - 1; j >= 0; j --){
    //         if (h[j] > h[i]){
    //             to_left[i] = j;
    //             break;
    //         }
    //     }
    // }

    for (int i = 0; i < n; i ++){
        dp[i][0] = i;
        dp_right[i][0] = i;
        for (int j = 1; j <= T; j ++){
            dp[i][j] = (h[to_left[dp[i][j - 1]]] > h[to_right[dp[i][j - 1]]]) ? to_left[dp[i][j - 1]] : to_right[dp[i][j - 1]];
            dp_right[i][j] = to_right[dp_right[i][j - 1]];
        }
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    if (subtask1) return C - B;

    B++, D++;

    int mx = get(C, D, n + 1);
    
    int l = A - 1, r = B - 1;
    if (get(r, C, n + 1) > mx)
        return -1;
    while (r - l > 1){
        int mid = (l + r) / 2;
        if (get(mid, C, n + 1) > mx)
            l = mid;
        else
            r = mid;
    }

    int val = get(r, B, mx);

    if (val == -1)
        return -1;

    int st = pos[val];
    if (get(st, C, n + 1) > mx) return -1;

    int ope = 0;

    if (C + 1 == D){
        while (h[dp[st][T]] < h[C]){
            st = dp[st][T];
            ope += T;
        }
        for (int i = 1; i < T; i ++){
            if (h[dp[st][T - i]] < h[C]){
                st = dp[st][T - i];
                ope += T - i;
                break;
            }
        }

        while (h[dp_right[st][T]] < h[C]){
            st = dp_right[st][T];
            ope += T;
        }

        for (int i = 1; i < T; i ++){
            if (h[dp_right[st][i]] == h[C]){
                ope += i;
                break;
            }
        }
    }
    else{
        while (st < C){
            ope++;
            int opt1 = to_left[st];
            int opt2 = to_right[st];

            if (opt2 >= C or h[opt2] > h[opt1] or h[opt1] > mx)
                st = opt2;
            else
                st = opt1;
        }
    }

    return ope;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 25176 KB Output is correct
2 Correct 6 ms 25176 KB Output is correct
3 Correct 598 ms 461172 KB Output is correct
4 Correct 1088 ms 570184 KB Output is correct
5 Correct 728 ms 299392 KB Output is correct
6 Correct 1068 ms 570384 KB Output is correct
7 Correct 748 ms 400204 KB Output is correct
8 Correct 1072 ms 570092 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 5 ms 25176 KB Output is correct
3 Correct 5 ms 25176 KB Output is correct
4 Correct 6 ms 25432 KB Output is correct
5 Correct 6 ms 25176 KB Output is correct
6 Correct 7 ms 25176 KB Output is correct
7 Correct 6 ms 25176 KB Output is correct
8 Correct 6 ms 25176 KB Output is correct
9 Correct 6 ms 25176 KB Output is correct
10 Correct 7 ms 25220 KB Output is correct
11 Correct 7 ms 25172 KB Output is correct
12 Correct 7 ms 25176 KB Output is correct
13 Correct 7 ms 25176 KB Output is correct
14 Correct 7 ms 25176 KB Output is correct
15 Correct 6 ms 25176 KB Output is correct
16 Correct 7 ms 25176 KB Output is correct
17 Correct 7 ms 25176 KB Output is correct
18 Correct 6 ms 25176 KB Output is correct
19 Correct 6 ms 25176 KB Output is correct
20 Correct 7 ms 25176 KB Output is correct
21 Correct 7 ms 25176 KB Output is correct
22 Correct 6 ms 25176 KB Output is correct
23 Correct 6 ms 25244 KB Output is correct
24 Correct 6 ms 25176 KB Output is correct
25 Correct 5 ms 25176 KB Output is correct
26 Correct 5 ms 25176 KB Output is correct
27 Correct 6 ms 25176 KB Output is correct
28 Correct 6 ms 25176 KB Output is correct
29 Correct 6 ms 25176 KB Output is correct
30 Correct 6 ms 25176 KB Output is correct
31 Correct 7 ms 25176 KB Output is correct
32 Correct 7 ms 25176 KB Output is correct
33 Correct 5 ms 25204 KB Output is correct
34 Correct 6 ms 25176 KB Output is correct
35 Correct 6 ms 25176 KB Output is correct
36 Correct 6 ms 25176 KB Output is correct
37 Correct 6 ms 25176 KB Output is correct
38 Correct 6 ms 25176 KB Output is correct
39 Correct 6 ms 25176 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 5 ms 25176 KB Output is correct
3 Correct 5 ms 25176 KB Output is correct
4 Correct 6 ms 25432 KB Output is correct
5 Correct 6 ms 25176 KB Output is correct
6 Correct 7 ms 25176 KB Output is correct
7 Correct 6 ms 25176 KB Output is correct
8 Correct 6 ms 25176 KB Output is correct
9 Correct 6 ms 25176 KB Output is correct
10 Correct 7 ms 25220 KB Output is correct
11 Correct 7 ms 25172 KB Output is correct
12 Correct 7 ms 25176 KB Output is correct
13 Correct 7 ms 25176 KB Output is correct
14 Correct 7 ms 25176 KB Output is correct
15 Correct 6 ms 25176 KB Output is correct
16 Correct 7 ms 25176 KB Output is correct
17 Correct 7 ms 25176 KB Output is correct
18 Correct 6 ms 25176 KB Output is correct
19 Correct 6 ms 25176 KB Output is correct
20 Correct 7 ms 25176 KB Output is correct
21 Correct 7 ms 25176 KB Output is correct
22 Correct 6 ms 25176 KB Output is correct
23 Correct 6 ms 25244 KB Output is correct
24 Correct 6 ms 25176 KB Output is correct
25 Correct 5 ms 25176 KB Output is correct
26 Correct 5 ms 25176 KB Output is correct
27 Correct 6 ms 25176 KB Output is correct
28 Correct 6 ms 25176 KB Output is correct
29 Correct 6 ms 25176 KB Output is correct
30 Correct 6 ms 25176 KB Output is correct
31 Correct 7 ms 25176 KB Output is correct
32 Correct 7 ms 25176 KB Output is correct
33 Correct 5 ms 25204 KB Output is correct
34 Correct 6 ms 25176 KB Output is correct
35 Correct 6 ms 25176 KB Output is correct
36 Correct 6 ms 25176 KB Output is correct
37 Correct 6 ms 25176 KB Output is correct
38 Correct 6 ms 25176 KB Output is correct
39 Correct 6 ms 25176 KB Output is correct
40 Correct 5 ms 25176 KB Output is correct
41 Correct 5 ms 25188 KB Output is correct
42 Correct 5 ms 25176 KB Output is correct
43 Correct 5 ms 25176 KB Output is correct
44 Correct 6 ms 25176 KB Output is correct
45 Correct 7 ms 25176 KB Output is correct
46 Correct 6 ms 25172 KB Output is correct
47 Correct 6 ms 25176 KB Output is correct
48 Correct 6 ms 25196 KB Output is correct
49 Correct 7 ms 25176 KB Output is correct
50 Correct 7 ms 25176 KB Output is correct
51 Correct 6 ms 25176 KB Output is correct
52 Correct 7 ms 25176 KB Output is correct
53 Correct 6 ms 25176 KB Output is correct
54 Correct 6 ms 25176 KB Output is correct
55 Correct 6 ms 25176 KB Output is correct
56 Correct 7 ms 25196 KB Output is correct
57 Correct 6 ms 25176 KB Output is correct
58 Correct 17 ms 29528 KB Output is correct
59 Correct 22 ms 29528 KB Output is correct
60 Correct 10 ms 25176 KB Output is correct
61 Correct 22 ms 29528 KB Output is correct
62 Correct 12 ms 25176 KB Output is correct
63 Correct 24 ms 29528 KB Output is correct
64 Correct 19 ms 29528 KB Output is correct
65 Correct 24 ms 29524 KB Output is correct
66 Correct 26 ms 29528 KB Output is correct
67 Correct 22 ms 29528 KB Output is correct
68 Correct 25 ms 29528 KB Output is correct
69 Correct 26 ms 29528 KB Output is correct
70 Correct 21 ms 29528 KB Output is correct
71 Correct 6 ms 25212 KB Output is correct
72 Correct 6 ms 25172 KB Output is correct
73 Correct 7 ms 25172 KB Output is correct
74 Correct 7 ms 25176 KB Output is correct
75 Correct 6 ms 25176 KB Output is correct
76 Correct 6 ms 25176 KB Output is correct
77 Correct 7 ms 25176 KB Output is correct
78 Correct 5 ms 25176 KB Output is correct
79 Correct 5 ms 25176 KB Output is correct
80 Correct 6 ms 25176 KB Output is correct
81 Correct 7 ms 25248 KB Output is correct
82 Correct 6 ms 25176 KB Output is correct
83 Correct 7 ms 25176 KB Output is correct
84 Correct 6 ms 25176 KB Output is correct
85 Correct 6 ms 25260 KB Output is correct
86 Correct 5 ms 25176 KB Output is correct
87 Correct 6 ms 25176 KB Output is correct
88 Correct 6 ms 25176 KB Output is correct
89 Correct 6 ms 25176 KB Output is correct
90 Correct 6 ms 25176 KB Output is correct
91 Correct 7 ms 25176 KB Output is correct
92 Correct 7 ms 25172 KB Output is correct
93 Correct 6 ms 25176 KB Output is correct
94 Correct 7 ms 25176 KB Output is correct
95 Correct 23 ms 29528 KB Output is correct
96 Incorrect 22 ms 29528 KB Output isn't correct
97 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 5 ms 25176 KB Output is correct
3 Correct 6 ms 25176 KB Output is correct
4 Correct 5 ms 25176 KB Output is correct
5 Correct 451 ms 465464 KB Output is correct
6 Correct 599 ms 569684 KB Output is correct
7 Correct 288 ms 302620 KB Output is correct
8 Correct 585 ms 569892 KB Output is correct
9 Correct 83 ms 107792 KB Output is correct
10 Correct 589 ms 569708 KB Output is correct
11 Correct 501 ms 570116 KB Output is correct
12 Correct 496 ms 569908 KB Output is correct
13 Correct 492 ms 570040 KB Output is correct
14 Correct 573 ms 569876 KB Output is correct
15 Correct 524 ms 569768 KB Output is correct
16 Correct 513 ms 570208 KB Output is correct
17 Correct 533 ms 570176 KB Output is correct
18 Correct 5 ms 25176 KB Output is correct
19 Correct 6 ms 25260 KB Output is correct
20 Correct 6 ms 25176 KB Output is correct
21 Correct 6 ms 25176 KB Output is correct
22 Correct 6 ms 25176 KB Output is correct
23 Correct 6 ms 25180 KB Output is correct
24 Correct 6 ms 25176 KB Output is correct
25 Correct 5 ms 25428 KB Output is correct
26 Correct 7 ms 25176 KB Output is correct
27 Correct 10 ms 29560 KB Output is correct
28 Correct 10 ms 29528 KB Output is correct
29 Correct 11 ms 29528 KB Output is correct
30 Correct 10 ms 29528 KB Output is correct
31 Correct 10 ms 29528 KB Output is correct
32 Correct 5 ms 25176 KB Output is correct
33 Correct 575 ms 569360 KB Output is correct
34 Correct 582 ms 569808 KB Output is correct
35 Correct 495 ms 569908 KB Output is correct
36 Correct 578 ms 569796 KB Output is correct
37 Correct 534 ms 569864 KB Output is correct
38 Correct 502 ms 570096 KB Output is correct
39 Correct 5 ms 25184 KB Output is correct
40 Correct 320 ms 342256 KB Output is correct
41 Correct 596 ms 569668 KB Output is correct
42 Correct 493 ms 570112 KB Output is correct
43 Correct 587 ms 569884 KB Output is correct
44 Correct 516 ms 570164 KB Output is correct
45 Correct 511 ms 570160 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 5 ms 25176 KB Output is correct
3 Correct 5 ms 25176 KB Output is correct
4 Correct 408 ms 275436 KB Output is correct
5 Correct 1264 ms 569656 KB Output is correct
6 Correct 622 ms 114212 KB Output is correct
7 Correct 1430 ms 569672 KB Output is correct
8 Correct 542 ms 212248 KB Output is correct
9 Correct 1306 ms 569896 KB Output is correct
10 Correct 1072 ms 570188 KB Output is correct
11 Incorrect 2394 ms 570376 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 5 ms 25176 KB Output is correct
3 Correct 5 ms 25176 KB Output is correct
4 Correct 408 ms 275436 KB Output is correct
5 Correct 1264 ms 569656 KB Output is correct
6 Correct 622 ms 114212 KB Output is correct
7 Correct 1430 ms 569672 KB Output is correct
8 Correct 542 ms 212248 KB Output is correct
9 Correct 1306 ms 569896 KB Output is correct
10 Correct 1072 ms 570188 KB Output is correct
11 Incorrect 2394 ms 570376 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 25176 KB Output is correct
2 Correct 6 ms 25176 KB Output is correct
3 Correct 598 ms 461172 KB Output is correct
4 Correct 1088 ms 570184 KB Output is correct
5 Correct 728 ms 299392 KB Output is correct
6 Correct 1068 ms 570384 KB Output is correct
7 Correct 748 ms 400204 KB Output is correct
8 Correct 1072 ms 570092 KB Output is correct
9 Correct 5 ms 25176 KB Output is correct
10 Correct 5 ms 25176 KB Output is correct
11 Correct 5 ms 25176 KB Output is correct
12 Correct 6 ms 25432 KB Output is correct
13 Correct 6 ms 25176 KB Output is correct
14 Correct 7 ms 25176 KB Output is correct
15 Correct 6 ms 25176 KB Output is correct
16 Correct 6 ms 25176 KB Output is correct
17 Correct 6 ms 25176 KB Output is correct
18 Correct 7 ms 25220 KB Output is correct
19 Correct 7 ms 25172 KB Output is correct
20 Correct 7 ms 25176 KB Output is correct
21 Correct 7 ms 25176 KB Output is correct
22 Correct 7 ms 25176 KB Output is correct
23 Correct 6 ms 25176 KB Output is correct
24 Correct 7 ms 25176 KB Output is correct
25 Correct 7 ms 25176 KB Output is correct
26 Correct 6 ms 25176 KB Output is correct
27 Correct 6 ms 25176 KB Output is correct
28 Correct 7 ms 25176 KB Output is correct
29 Correct 7 ms 25176 KB Output is correct
30 Correct 6 ms 25176 KB Output is correct
31 Correct 6 ms 25244 KB Output is correct
32 Correct 6 ms 25176 KB Output is correct
33 Correct 5 ms 25176 KB Output is correct
34 Correct 5 ms 25176 KB Output is correct
35 Correct 6 ms 25176 KB Output is correct
36 Correct 6 ms 25176 KB Output is correct
37 Correct 6 ms 25176 KB Output is correct
38 Correct 6 ms 25176 KB Output is correct
39 Correct 7 ms 25176 KB Output is correct
40 Correct 7 ms 25176 KB Output is correct
41 Correct 5 ms 25204 KB Output is correct
42 Correct 6 ms 25176 KB Output is correct
43 Correct 6 ms 25176 KB Output is correct
44 Correct 6 ms 25176 KB Output is correct
45 Correct 6 ms 25176 KB Output is correct
46 Correct 6 ms 25176 KB Output is correct
47 Correct 6 ms 25176 KB Output is correct
48 Correct 5 ms 25176 KB Output is correct
49 Correct 5 ms 25188 KB Output is correct
50 Correct 5 ms 25176 KB Output is correct
51 Correct 5 ms 25176 KB Output is correct
52 Correct 6 ms 25176 KB Output is correct
53 Correct 7 ms 25176 KB Output is correct
54 Correct 6 ms 25172 KB Output is correct
55 Correct 6 ms 25176 KB Output is correct
56 Correct 6 ms 25196 KB Output is correct
57 Correct 7 ms 25176 KB Output is correct
58 Correct 7 ms 25176 KB Output is correct
59 Correct 6 ms 25176 KB Output is correct
60 Correct 7 ms 25176 KB Output is correct
61 Correct 6 ms 25176 KB Output is correct
62 Correct 6 ms 25176 KB Output is correct
63 Correct 6 ms 25176 KB Output is correct
64 Correct 7 ms 25196 KB Output is correct
65 Correct 6 ms 25176 KB Output is correct
66 Correct 17 ms 29528 KB Output is correct
67 Correct 22 ms 29528 KB Output is correct
68 Correct 10 ms 25176 KB Output is correct
69 Correct 22 ms 29528 KB Output is correct
70 Correct 12 ms 25176 KB Output is correct
71 Correct 24 ms 29528 KB Output is correct
72 Correct 19 ms 29528 KB Output is correct
73 Correct 24 ms 29524 KB Output is correct
74 Correct 26 ms 29528 KB Output is correct
75 Correct 22 ms 29528 KB Output is correct
76 Correct 25 ms 29528 KB Output is correct
77 Correct 26 ms 29528 KB Output is correct
78 Correct 21 ms 29528 KB Output is correct
79 Correct 6 ms 25212 KB Output is correct
80 Correct 6 ms 25172 KB Output is correct
81 Correct 7 ms 25172 KB Output is correct
82 Correct 7 ms 25176 KB Output is correct
83 Correct 6 ms 25176 KB Output is correct
84 Correct 6 ms 25176 KB Output is correct
85 Correct 7 ms 25176 KB Output is correct
86 Correct 5 ms 25176 KB Output is correct
87 Correct 5 ms 25176 KB Output is correct
88 Correct 6 ms 25176 KB Output is correct
89 Correct 7 ms 25248 KB Output is correct
90 Correct 6 ms 25176 KB Output is correct
91 Correct 7 ms 25176 KB Output is correct
92 Correct 6 ms 25176 KB Output is correct
93 Correct 6 ms 25260 KB Output is correct
94 Correct 5 ms 25176 KB Output is correct
95 Correct 6 ms 25176 KB Output is correct
96 Correct 6 ms 25176 KB Output is correct
97 Correct 6 ms 25176 KB Output is correct
98 Correct 6 ms 25176 KB Output is correct
99 Correct 7 ms 25176 KB Output is correct
100 Correct 7 ms 25172 KB Output is correct
101 Correct 6 ms 25176 KB Output is correct
102 Correct 7 ms 25176 KB Output is correct
103 Correct 23 ms 29528 KB Output is correct
104 Incorrect 22 ms 29528 KB Output isn't correct
105 Halted 0 ms 0 KB -