oj.uz

Submission #561380

# Submission time Handle Problem Language Result Execution time Memory
561380 2022-05-12T17:41:50 Z piOOE Rainforest Jumps (APIO21_jumps) C++17
60 / 100
 1472 ms 47968 KB 
#include "jumps.h"

#include <bits/stdc++.h>

using namespace std;

#define all(x) begin(x), end(x)

const int logn = 19, N = 200001;

int h[N], jump[logn][N], R[N], L[N], spt[logn][N], n, jmp[logn][N];
const int infI = 1e9 + 7;

bool okk = true;

int Min(int i, int j) {
    return h[i] < h[j] ? i : j;
}

int Max(int i, int j) {
    return h[i] > h[j] ? i : j;
}

int get_max(int l, int r) {
    if (r <= l) return -1;
    int sz = __lg(r - l);
    return Max(spt[sz][l], spt[sz][r - (1 << sz)]);
}

void init(int nn, vector<int> H) {
    n = nn;
    for (int i = 0; i < n; ++i) {
        h[i] = H[i];
        okk &= (H[i] == i + 1);
    }
    vector<int> st;
    for (int i = 0; i < n; ++i) {
        while (!st.empty() && h[st.back()] < h[i]) {
            R[st.back()] = i;
            st.pop_back();
        }
        if (st.empty()) {
            L[i] = -1;
        } else {
            L[i] = st.back();
        }
        st.push_back(i);
    }
    for (int i: st) {
        R[i] = n;
    }
    st.clear();
    for (int i = 0; i < n; ++i) {
        if (R[i] == n)
            jump[0][i] = L[i];
        else if (L[i] == -1)
            jump[0][i] = R[i];
        else
            jump[0][i] = Max(L[i], R[i]);
        jmp[0][i] = R[i];
        spt[0][i] = i;
    }
    jmp[0][n] = n;
    jump[0][n] = -1;
    for (int j = 1; j < logn; ++j) {
        for (int i = 0; i <= n; ++i) {
            if (jump[j - 1][i] != -1)
                jump[j][i] = jump[j - 1][jump[j - 1][i]];
            else
                jump[j][i] = -1;
            jmp[j][i] = jmp[j - 1][jmp[j - 1][i]];
        }
    }
    for (int j = 1; j < logn; ++j) {
        for (int i = 0; i + (1 << j) <= n; ++i) {
            spt[j][i] = Max(spt[j - 1][i], spt[j - 1][i + (1 << (j - 1))]);
        }
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    if (okk) {
        return C - B;
    }
    ++D, ++B;
    int mxcd = get_max(C, D);
    int lx = A - 1, rx = C;
    while (lx + 1 < rx) {
        int m = (lx + rx) >> 1;
        if (h[get_max(m, C)] < h[mxcd]) rx = m;
        else lx = m;
    }
    if (rx >= B) {
        return -1;
    }
    int i = get_max(rx, B);
    int ans = infI;
    int nw = 0;
    for (int j = logn - 1; j > -1; --j) {
        if (jump[j][i] == -1 || h[jump[j][i]] >= h[C]) continue;
        nw += (1 << j);
        i = jump[j][i];
    }
    assert(L[i] != C);
    assert(i < C);
    if (R[i] >= C && R[i] < D) {
        ans = nw + 1;
    }
    else {
        if (L[i] != -1 && h[L[i]] < h[mxcd]) {
            ans = nw + 2;
        }
    }
    for (int j = logn - 1; j > -1; --j) {
        if (jmp[j][i] < C) {
            nw += (1 << j);
            i = jmp[j][i];
        }
    }
    assert(R[i] >= C && R[i] < D);
    return min(ans, nw + 1);
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 133 ms 37460 KB Output is correct
4 Correct 761 ms 47012 KB Output is correct
5 Correct 898 ms 23668 KB Output is correct
6 Correct 1053 ms 47128 KB Output is correct
7 Correct 883 ms 32076 KB Output is correct
8 Correct 1016 ms 47024 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Incorrect 2 ms 464 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Incorrect 2 ms 464 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 484 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 57 ms 37912 KB Output is correct
6 Correct 69 ms 47124 KB Output is correct
7 Correct 29 ms 23996 KB Output is correct
8 Correct 72 ms 46984 KB Output is correct
9 Correct 9 ms 7212 KB Output is correct
10 Correct 89 ms 47032 KB Output is correct
11 Correct 67 ms 47028 KB Output is correct
12 Correct 104 ms 46932 KB Output is correct
13 Correct 61 ms 46956 KB Output is correct
14 Correct 63 ms 47012 KB Output is correct
15 Correct 55 ms 47500 KB Output is correct
16 Correct 57 ms 47880 KB Output is correct
17 Correct 70 ms 47868 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 640 KB Output is correct
20 Correct 1 ms 640 KB Output is correct
21 Correct 1 ms 624 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 1 ms 592 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 640 KB Output is correct
26 Correct 1 ms 748 KB Output is correct
27 Correct 1 ms 1024 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 1016 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 2 ms 976 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 53 ms 47032 KB Output is correct
34 Correct 69 ms 47028 KB Output is correct
35 Correct 70 ms 47036 KB Output is correct
36 Correct 76 ms 47004 KB Output is correct
37 Correct 66 ms 47476 KB Output is correct
38 Correct 70 ms 47912 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 44 ms 27180 KB Output is correct
41 Correct 70 ms 46960 KB Output is correct
42 Correct 72 ms 47028 KB Output is correct
43 Correct 68 ms 47032 KB Output is correct
44 Correct 63 ms 47532 KB Output is correct
45 Correct 66 ms 47964 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 484 KB Output is correct
4 Correct 287 ms 21496 KB Output is correct
5 Correct 1002 ms 47048 KB Output is correct
6 Correct 736 ms 7940 KB Output is correct
7 Correct 1014 ms 47024 KB Output is correct
8 Correct 439 ms 16184 KB Output is correct
9 Correct 1148 ms 46960 KB Output is correct
10 Correct 758 ms 47048 KB Output is correct
11 Correct 1188 ms 47028 KB Output is correct
12 Correct 1125 ms 47028 KB Output is correct
13 Correct 793 ms 47028 KB Output is correct
14 Correct 1144 ms 47492 KB Output is correct
15 Correct 935 ms 47944 KB Output is correct
16 Correct 814 ms 47924 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 3 ms 592 KB Output is correct
21 Correct 3 ms 592 KB Output is correct
22 Correct 4 ms 592 KB Output is correct
23 Correct 3 ms 592 KB Output is correct
24 Correct 2 ms 592 KB Output is correct
25 Correct 1 ms 652 KB Output is correct
26 Correct 1 ms 720 KB Output is correct
27 Correct 10 ms 976 KB Output is correct
28 Correct 23 ms 976 KB Output is correct
29 Correct 10 ms 976 KB Output is correct
30 Correct 18 ms 976 KB Output is correct
31 Correct 11 ms 976 KB Output is correct
32 Correct 0 ms 512 KB Output is correct
33 Correct 29 ms 27132 KB Output is correct
34 Correct 67 ms 47024 KB Output is correct
35 Correct 60 ms 47036 KB Output is correct
36 Correct 50 ms 46920 KB Output is correct
37 Correct 48 ms 47508 KB Output is correct
38 Correct 55 ms 47964 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 484 KB Output is correct
4 Correct 287 ms 21496 KB Output is correct
5 Correct 1002 ms 47048 KB Output is correct
6 Correct 736 ms 7940 KB Output is correct
7 Correct 1014 ms 47024 KB Output is correct
8 Correct 439 ms 16184 KB Output is correct
9 Correct 1148 ms 46960 KB Output is correct
10 Correct 758 ms 47048 KB Output is correct
11 Correct 1188 ms 47028 KB Output is correct
12 Correct 1125 ms 47028 KB Output is correct
13 Correct 793 ms 47028 KB Output is correct
14 Correct 1144 ms 47492 KB Output is correct
15 Correct 935 ms 47944 KB Output is correct
16 Correct 814 ms 47924 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 3 ms 592 KB Output is correct
21 Correct 3 ms 592 KB Output is correct
22 Correct 4 ms 592 KB Output is correct
23 Correct 3 ms 592 KB Output is correct
24 Correct 2 ms 592 KB Output is correct
25 Correct 1 ms 652 KB Output is correct
26 Correct 1 ms 720 KB Output is correct
27 Correct 10 ms 976 KB Output is correct
28 Correct 23 ms 976 KB Output is correct
29 Correct 10 ms 976 KB Output is correct
30 Correct 18 ms 976 KB Output is correct
31 Correct 11 ms 976 KB Output is correct
32 Correct 0 ms 512 KB Output is correct
33 Correct 29 ms 27132 KB Output is correct
34 Correct 67 ms 47024 KB Output is correct
35 Correct 60 ms 47036 KB Output is correct
36 Correct 50 ms 46920 KB Output is correct
37 Correct 48 ms 47508 KB Output is correct
38 Correct 55 ms 47964 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 0 ms 464 KB Output is correct
41 Correct 1 ms 464 KB Output is correct
42 Correct 191 ms 21416 KB Output is correct
43 Correct 992 ms 46980 KB Output is correct
44 Correct 591 ms 7888 KB Output is correct
45 Correct 978 ms 46976 KB Output is correct
46 Correct 617 ms 16256 KB Output is correct
47 Correct 913 ms 47032 KB Output is correct
48 Correct 790 ms 47028 KB Output is correct
49 Correct 1193 ms 47020 KB Output is correct
50 Correct 1472 ms 47056 KB Output is correct
51 Correct 1042 ms 47024 KB Output is correct
52 Correct 1256 ms 47548 KB Output is correct
53 Correct 894 ms 47912 KB Output is correct
54 Correct 1094 ms 47968 KB Output is correct
55 Correct 0 ms 464 KB Output is correct
56 Correct 110 ms 46976 KB Output is correct
57 Correct 1022 ms 47008 KB Output is correct
58 Correct 426 ms 8352 KB Output is correct
59 Correct 784 ms 46936 KB Output is correct
60 Correct 495 ms 16700 KB Output is correct
61 Correct 1067 ms 47000 KB Output is correct
62 Correct 731 ms 46992 KB Output is correct
63 Correct 1037 ms 47024 KB Output is correct
64 Correct 1191 ms 46968 KB Output is correct
65 Correct 947 ms 46968 KB Output is correct
66 Correct 1173 ms 47568 KB Output is correct
67 Correct 856 ms 47880 KB Output is correct
68 Correct 923 ms 47912 KB Output is correct
69 Correct 0 ms 464 KB Output is correct
70 Correct 1 ms 508 KB Output is correct
71 Correct 3 ms 628 KB Output is correct
72 Correct 3 ms 592 KB Output is correct
73 Correct 2 ms 592 KB Output is correct
74 Correct 4 ms 592 KB Output is correct
75 Correct 2 ms 640 KB Output is correct
76 Correct 0 ms 464 KB Output is correct
77 Correct 1 ms 464 KB Output is correct
78 Correct 2 ms 464 KB Output is correct
79 Correct 1 ms 592 KB Output is correct
80 Correct 3 ms 592 KB Output is correct
81 Correct 2 ms 592 KB Output is correct
82 Correct 2 ms 592 KB Output is correct
83 Correct 2 ms 592 KB Output is correct
84 Correct 1 ms 592 KB Output is correct
85 Correct 3 ms 592 KB Output is correct
86 Correct 11 ms 976 KB Output is correct
87 Correct 18 ms 976 KB Output is correct
88 Correct 17 ms 976 KB Output is correct
89 Correct 23 ms 976 KB Output is correct
90 Correct 22 ms 976 KB Output is correct
91 Correct 1 ms 592 KB Output is correct
92 Correct 1 ms 720 KB Output is correct
93 Correct 13 ms 976 KB Output is correct
94 Correct 20 ms 976 KB Output is correct
95 Correct 24 ms 1024 KB Output is correct
96 Correct 19 ms 976 KB Output is correct
97 Correct 25 ms 976 KB Output is correct
98 Correct 1 ms 464 KB Output is correct
99 Correct 69 ms 47024 KB Output is correct
100 Correct 50 ms 46988 KB Output is correct
101 Correct 67 ms 47012 KB Output is correct
102 Correct 67 ms 47032 KB Output is correct
103 Correct 55 ms 47524 KB Output is correct
104 Correct 81 ms 47892 KB Output is correct
105 Correct 0 ms 464 KB Output is correct
106 Correct 29 ms 27172 KB Output is correct
107 Correct 50 ms 47052 KB Output is correct
108 Correct 56 ms 47124 KB Output is correct
109 Correct 53 ms 46972 KB Output is correct
110 Correct 56 ms 47540 KB Output is correct
111 Correct 64 ms 47848 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 133 ms 37460 KB Output is correct
4 Correct 761 ms 47012 KB Output is correct
5 Correct 898 ms 23668 KB Output is correct
6 Correct 1053 ms 47128 KB Output is correct
7 Correct 883 ms 32076 KB Output is correct
8 Correct 1016 ms 47024 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Incorrect 2 ms 464 KB Output isn't correct
14 Halted 0 ms 0 KB -