oj.uz

Submission #981564

# Submission time Handle Problem Language Result Execution time Memory
981564 2024-05-13T10:40:34 Z Ghulam_Junaid Rainforest Jumps (APIO21_jumps) C++17
33 / 100
 4000 ms 570484 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_left[MXN][T + 1], dp_right[MXN][T + 1];
vector<int> seg[4 * MXN], h;

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;

    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_left[i][1] = to_left[i];
        dp_right[i][1] = to_right[i];
    }

    for (int j = 2; j <= T; j ++){
        for (int i = 0; i < n; i ++){
            dp_left[i][j] = min(to_left[dp_left[i][j - 1]], to_left[dp_right[i][j - 1]]);
            dp_right[i][j] = max(to_right[dp_left[i][j - 1]], to_right[dp_right[i][j - 1]]);
        }
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    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 == D){
        while (st < C){
            if (h[dp_left[st][T]] < h[C] and h[dp_right[st][T]] < h[C]){
                if (h[dp_left[st][T]] > h[dp_right[st][T]])
                    st = dp_left[st][T];
                else
                    st = dp_right[st][T];
                ope += T;
            }
            else{
                for (int i = 1; i < T; i ++){
                    if (h[dp_left[st][T - i]] < h[C] and h[dp_right[st][T - i]] < h[C]){
                        ope += T - i + 1;
                        break;
                    }
                }
                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
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 25176 KB Output is correct
2 Correct 5 ms 25176 KB Output is correct
3 Correct 2515 ms 460712 KB Output is correct
4 Execution timed out 4051 ms 570296 KB Time limit exceeded
5 Halted 0 ms 0 KB -

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 25212 KB Output is correct
3 Correct 5 ms 25176 KB Output is correct
4 Correct 5 ms 25176 KB Output is correct
5 Correct 6 ms 25340 KB Output is correct
6 Correct 7 ms 25432 KB Output is correct
7 Correct 6 ms 25176 KB Output is correct
8 Correct 6 ms 25196 KB Output is correct
9 Correct 6 ms 25176 KB Output is correct
10 Correct 6 ms 25176 KB Output is correct
11 Correct 6 ms 25176 KB Output is correct
12 Correct 6 ms 25176 KB Output is correct
13 Correct 7 ms 25196 KB Output is correct
14 Correct 6 ms 25176 KB Output is correct
15 Correct 6 ms 25176 KB Output is correct
16 Correct 8 ms 25176 KB Output is correct
17 Correct 7 ms 25176 KB Output is correct
18 Correct 5 ms 25176 KB Output is correct
19 Correct 5 ms 25204 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 25176 KB Output is correct
24 Correct 7 ms 25372 KB Output is correct
25 Correct 6 ms 25176 KB Output is correct
26 Correct 6 ms 25204 KB Output is correct
27 Correct 5 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 7 ms 25176 KB Output is correct
31 Correct 6 ms 25176 KB Output is correct
32 Correct 7 ms 25176 KB Output is correct
33 Correct 5 ms 25176 KB Output is correct
34 Correct 5 ms 25208 KB Output is correct
35 Correct 6 ms 25176 KB Output is correct
36 Correct 5 ms 25176 KB Output is correct
37 Correct 6 ms 25208 KB Output is correct
38 Correct 5 ms 25176 KB Output is correct
39 Correct 5 ms 25200 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 5 ms 25212 KB Output is correct
3 Correct 5 ms 25176 KB Output is correct
4 Correct 5 ms 25176 KB Output is correct
5 Correct 6 ms 25340 KB Output is correct
6 Correct 7 ms 25432 KB Output is correct
7 Correct 6 ms 25176 KB Output is correct
8 Correct 6 ms 25196 KB Output is correct
9 Correct 6 ms 25176 KB Output is correct
10 Correct 6 ms 25176 KB Output is correct
11 Correct 6 ms 25176 KB Output is correct
12 Correct 6 ms 25176 KB Output is correct
13 Correct 7 ms 25196 KB Output is correct
14 Correct 6 ms 25176 KB Output is correct
15 Correct 6 ms 25176 KB Output is correct
16 Correct 8 ms 25176 KB Output is correct
17 Correct 7 ms 25176 KB Output is correct
18 Correct 5 ms 25176 KB Output is correct
19 Correct 5 ms 25204 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 25176 KB Output is correct
24 Correct 7 ms 25372 KB Output is correct
25 Correct 6 ms 25176 KB Output is correct
26 Correct 6 ms 25204 KB Output is correct
27 Correct 5 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 7 ms 25176 KB Output is correct
31 Correct 6 ms 25176 KB Output is correct
32 Correct 7 ms 25176 KB Output is correct
33 Correct 5 ms 25176 KB Output is correct
34 Correct 5 ms 25208 KB Output is correct
35 Correct 6 ms 25176 KB Output is correct
36 Correct 5 ms 25176 KB Output is correct
37 Correct 6 ms 25208 KB Output is correct
38 Correct 5 ms 25176 KB Output is correct
39 Correct 5 ms 25200 KB Output is correct
40 Correct 5 ms 25176 KB Output is correct
41 Correct 6 ms 25216 KB Output is correct
42 Correct 6 ms 25176 KB Output is correct
43 Correct 5 ms 25176 KB Output is correct
44 Correct 7 ms 25176 KB Output is correct
45 Correct 7 ms 25192 KB Output is correct
46 Correct 7 ms 25176 KB Output is correct
47 Correct 7 ms 25176 KB Output is correct
48 Correct 6 ms 25176 KB Output is correct
49 Correct 6 ms 25176 KB Output is correct
50 Correct 6 ms 25176 KB Output is correct
51 Correct 7 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 25176 KB Output is correct
55 Correct 6 ms 25176 KB Output is correct
56 Correct 7 ms 25176 KB Output is correct
57 Correct 5 ms 25176 KB Output is correct
58 Correct 15 ms 29528 KB Output is correct
59 Correct 20 ms 29592 KB Output is correct
60 Correct 9 ms 25176 KB Output is correct
61 Correct 19 ms 29528 KB Output is correct
62 Correct 11 ms 25176 KB Output is correct
63 Correct 19 ms 29528 KB Output is correct
64 Correct 23 ms 29528 KB Output is correct
65 Correct 25 ms 29528 KB Output is correct
66 Correct 25 ms 29528 KB Output is correct
67 Correct 21 ms 29528 KB Output is correct
68 Correct 20 ms 29528 KB Output is correct
69 Correct 23 ms 29528 KB Output is correct
70 Correct 23 ms 29528 KB Output is correct
71 Correct 6 ms 25176 KB Output is correct
72 Correct 6 ms 25176 KB Output is correct
73 Correct 6 ms 25176 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 6 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 25432 KB Output is correct
81 Correct 6 ms 25176 KB Output is correct
82 Correct 6 ms 25176 KB Output is correct
83 Correct 7 ms 25176 KB Output is correct
84 Correct 7 ms 25176 KB Output is correct
85 Correct 6 ms 25176 KB Output is correct
86 Correct 6 ms 25176 KB Output is correct
87 Correct 6 ms 25176 KB Output is correct
88 Correct 5 ms 25176 KB Output is correct
89 Correct 6 ms 25176 KB Output is correct
90 Correct 6 ms 25432 KB Output is correct
91 Correct 6 ms 25176 KB Output is correct
92 Correct 5 ms 25176 KB Output is correct
93 Correct 5 ms 25212 KB Output is correct
94 Correct 7 ms 25176 KB Output is correct
95 Correct 18 ms 29528 KB Output is correct
96 Correct 22 ms 29408 KB Output is correct
97 Correct 18 ms 29528 KB Output is correct
98 Correct 23 ms 29528 KB Output is correct
99 Correct 18 ms 29528 KB Output is correct
100 Correct 5 ms 25172 KB Output is correct
101 Correct 6 ms 25176 KB Output is correct
102 Correct 18 ms 29528 KB Output is correct
103 Correct 22 ms 29528 KB Output is correct
104 Correct 19 ms 29528 KB Output is correct
105 Correct 18 ms 29528 KB Output is correct
106 Correct 17 ms 29564 KB Output is correct
107 Correct 5 ms 25176 KB Output is correct
108 Correct 6 ms 25348 KB Output is correct
109 Correct 9 ms 29528 KB Output is correct
110 Correct 8 ms 29596 KB Output is correct
111 Correct 8 ms 29528 KB Output is correct
112 Correct 9 ms 29592 KB Output is correct
113 Correct 8 ms 29528 KB Output is correct

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 5 ms 25176 KB Output is correct
4 Correct 5 ms 25176 KB Output is correct
5 Correct 1377 ms 464656 KB Output is correct
6 Correct 1835 ms 569860 KB Output is correct
7 Correct 703 ms 303076 KB Output is correct
8 Correct 1817 ms 569860 KB Output is correct
9 Correct 112 ms 107792 KB Output is correct
10 Correct 1824 ms 569868 KB Output is correct
11 Correct 1759 ms 570296 KB Output is correct
12 Correct 1757 ms 570076 KB Output is correct
13 Correct 1801 ms 570052 KB Output is correct
14 Correct 1823 ms 569924 KB Output is correct
15 Correct 1794 ms 569920 KB Output is correct
16 Correct 1744 ms 570236 KB Output is correct
17 Correct 1742 ms 570428 KB Output is correct
18 Correct 5 ms 25176 KB Output is correct
19 Correct 5 ms 25176 KB Output is correct
20 Correct 5 ms 25176 KB Output is correct
21 Correct 5 ms 25176 KB Output is correct
22 Correct 5 ms 25176 KB Output is correct
23 Correct 5 ms 25176 KB Output is correct
24 Correct 5 ms 25176 KB Output is correct
25 Correct 5 ms 25176 KB Output is correct
26 Correct 6 ms 25176 KB Output is correct
27 Correct 8 ms 29528 KB Output is correct
28 Correct 8 ms 29528 KB Output is correct
29 Correct 9 ms 29528 KB Output is correct
30 Correct 9 ms 29528 KB Output is correct
31 Correct 9 ms 29528 KB Output is correct
32 Correct 5 ms 25176 KB Output is correct
33 Correct 1817 ms 569356 KB Output is correct
34 Correct 1800 ms 569668 KB Output is correct
35 Correct 1734 ms 570324 KB Output is correct
36 Correct 1785 ms 569876 KB Output is correct
37 Correct 1754 ms 569680 KB Output is correct
38 Correct 1750 ms 570288 KB Output is correct
39 Correct 5 ms 25176 KB Output is correct
40 Correct 788 ms 342544 KB Output is correct
41 Correct 1817 ms 569860 KB Output is correct
42 Correct 1843 ms 570180 KB Output is correct
43 Correct 1830 ms 569664 KB Output is correct
44 Correct 1741 ms 569884 KB Output is correct
45 Correct 1795 ms 570484 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 684 ms 275540 KB Output is correct
5 Correct 2535 ms 569668 KB Output is correct
6 Correct 552 ms 114068 KB Output is correct
7 Correct 2551 ms 569664 KB Output is correct
8 Correct 718 ms 212424 KB Output is correct
9 Correct 2526 ms 569860 KB Output is correct
10 Execution timed out 4013 ms 570288 KB Time limit exceeded
11 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 684 ms 275540 KB Output is correct
5 Correct 2535 ms 569668 KB Output is correct
6 Correct 552 ms 114068 KB Output is correct
7 Correct 2551 ms 569664 KB Output is correct
8 Correct 718 ms 212424 KB Output is correct
9 Correct 2526 ms 569860 KB Output is correct
10 Execution timed out 4013 ms 570288 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 25176 KB Output is correct
2 Correct 5 ms 25176 KB Output is correct
3 Correct 2515 ms 460712 KB Output is correct
4 Execution timed out 4051 ms 570296 KB Time limit exceeded
5 Halted 0 ms 0 KB -