oj.uz

Submission #561379

# Submission time Handle Problem Language Result Execution time Memory
561379 2022-05-12T17:41:19 Z piOOE Rainforest Jumps (APIO21_jumps) C++17
60 / 100
 1295 ms 47992 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) {
        return 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 93 ms 37404 KB Output is correct
4 Correct 867 ms 47032 KB Output is correct
5 Correct 755 ms 23596 KB Output is correct
6 Correct 770 ms 46984 KB Output is correct
7 Correct 740 ms 32076 KB Output is correct
8 Correct 925 ms 47048 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 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 472 KB Output is correct
5 Correct 54 ms 37936 KB Output is correct
6 Correct 72 ms 47028 KB Output is correct
7 Correct 25 ms 24068 KB Output is correct
8 Correct 75 ms 47032 KB Output is correct
9 Correct 11 ms 7296 KB Output is correct
10 Correct 69 ms 47028 KB Output is correct
11 Correct 69 ms 47064 KB Output is correct
12 Correct 48 ms 47052 KB Output is correct
13 Correct 49 ms 47000 KB Output is correct
14 Correct 73 ms 46948 KB Output is correct
15 Correct 55 ms 47540 KB Output is correct
16 Correct 71 ms 47804 KB Output is correct
17 Correct 63 ms 47856 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 592 KB Output is correct
20 Correct 1 ms 640 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 1 ms 640 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 1 ms 720 KB Output is correct
27 Correct 1 ms 976 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 976 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 1 ms 976 KB Output is correct
32 Correct 1 ms 512 KB Output is correct
33 Correct 51 ms 47048 KB Output is correct
34 Correct 55 ms 46960 KB Output is correct
35 Correct 59 ms 46996 KB Output is correct
36 Correct 56 ms 46956 KB Output is correct
37 Correct 66 ms 47520 KB Output is correct
38 Correct 60 ms 47872 KB Output is correct
39 Correct 0 ms 464 KB Output is correct
40 Correct 37 ms 27116 KB Output is correct
41 Correct 55 ms 46948 KB Output is correct
42 Correct 65 ms 47124 KB Output is correct
43 Correct 75 ms 46920 KB Output is correct
44 Correct 56 ms 47560 KB Output is correct
45 Correct 59 ms 47892 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 196 ms 21448 KB Output is correct
5 Correct 777 ms 47012 KB Output is correct
6 Correct 627 ms 7888 KB Output is correct
7 Correct 900 ms 47012 KB Output is correct
8 Correct 496 ms 16148 KB Output is correct
9 Correct 955 ms 47012 KB Output is correct
10 Correct 981 ms 47056 KB Output is correct
11 Correct 1138 ms 47016 KB Output is correct
12 Correct 1295 ms 47068 KB Output is correct
13 Correct 1018 ms 46988 KB Output is correct
14 Correct 1138 ms 47492 KB Output is correct
15 Correct 1050 ms 47920 KB Output is correct
16 Correct 1075 ms 47884 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 2 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 2 ms 592 KB Output is correct
24 Correct 3 ms 592 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 2 ms 764 KB Output is correct
27 Correct 21 ms 976 KB Output is correct
28 Correct 12 ms 976 KB Output is correct
29 Correct 29 ms 976 KB Output is correct
30 Correct 22 ms 976 KB Output is correct
31 Correct 23 ms 976 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 34 ms 27144 KB Output is correct
34 Correct 94 ms 47008 KB Output is correct
35 Correct 65 ms 47000 KB Output is correct
36 Correct 119 ms 47032 KB Output is correct
37 Correct 70 ms 47532 KB Output is correct
38 Correct 55 ms 47884 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 196 ms 21448 KB Output is correct
5 Correct 777 ms 47012 KB Output is correct
6 Correct 627 ms 7888 KB Output is correct
7 Correct 900 ms 47012 KB Output is correct
8 Correct 496 ms 16148 KB Output is correct
9 Correct 955 ms 47012 KB Output is correct
10 Correct 981 ms 47056 KB Output is correct
11 Correct 1138 ms 47016 KB Output is correct
12 Correct 1295 ms 47068 KB Output is correct
13 Correct 1018 ms 46988 KB Output is correct
14 Correct 1138 ms 47492 KB Output is correct
15 Correct 1050 ms 47920 KB Output is correct
16 Correct 1075 ms 47884 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 2 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 2 ms 592 KB Output is correct
24 Correct 3 ms 592 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 2 ms 764 KB Output is correct
27 Correct 21 ms 976 KB Output is correct
28 Correct 12 ms 976 KB Output is correct
29 Correct 29 ms 976 KB Output is correct
30 Correct 22 ms 976 KB Output is correct
31 Correct 23 ms 976 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 34 ms 27144 KB Output is correct
34 Correct 94 ms 47008 KB Output is correct
35 Correct 65 ms 47000 KB Output is correct
36 Correct 119 ms 47032 KB Output is correct
37 Correct 70 ms 47532 KB Output is correct
38 Correct 55 ms 47884 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 1 ms 464 KB Output is correct
41 Correct 1 ms 512 KB Output is correct
42 Correct 298 ms 21424 KB Output is correct
43 Correct 859 ms 47044 KB Output is correct
44 Correct 694 ms 7876 KB Output is correct
45 Correct 1150 ms 47024 KB Output is correct
46 Correct 626 ms 16200 KB Output is correct
47 Correct 1152 ms 46984 KB Output is correct
48 Correct 959 ms 47036 KB Output is correct
49 Correct 1132 ms 47000 KB Output is correct
50 Correct 1285 ms 47032 KB Output is correct
51 Correct 861 ms 46928 KB Output is correct
52 Correct 1141 ms 47504 KB Output is correct
53 Correct 848 ms 47896 KB Output is correct
54 Correct 940 ms 47892 KB Output is correct
55 Correct 1 ms 464 KB Output is correct
56 Correct 112 ms 47000 KB Output is correct
57 Correct 1061 ms 47024 KB Output is correct
58 Correct 331 ms 8388 KB Output is correct
59 Correct 959 ms 46988 KB Output is correct
60 Correct 321 ms 16700 KB Output is correct
61 Correct 1008 ms 46920 KB Output is correct
62 Correct 810 ms 47016 KB Output is correct
63 Correct 1186 ms 47024 KB Output is correct
64 Correct 942 ms 47008 KB Output is correct
65 Correct 1063 ms 47024 KB Output is correct
66 Correct 1240 ms 47532 KB Output is correct
67 Correct 1214 ms 47880 KB Output is correct
68 Correct 905 ms 47956 KB Output is correct
69 Correct 0 ms 464 KB Output is correct
70 Correct 1 ms 512 KB Output is correct
71 Correct 3 ms 628 KB Output is correct
72 Correct 3 ms 640 KB Output is correct
73 Correct 3 ms 592 KB Output is correct
74 Correct 3 ms 592 KB Output is correct
75 Correct 3 ms 592 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 1 ms 592 KB Output is correct
81 Correct 3 ms 612 KB Output is correct
82 Correct 3 ms 640 KB Output is correct
83 Correct 3 ms 592 KB Output is correct
84 Correct 1 ms 592 KB Output is correct
85 Correct 2 ms 592 KB Output is correct
86 Correct 17 ms 1012 KB Output is correct
87 Correct 22 ms 976 KB Output is correct
88 Correct 29 ms 976 KB Output is correct
89 Correct 13 ms 976 KB Output is correct
90 Correct 22 ms 976 KB Output is correct
91 Correct 1 ms 640 KB Output is correct
92 Correct 1 ms 768 KB Output is correct
93 Correct 26 ms 976 KB Output is correct
94 Correct 25 ms 1024 KB Output is correct
95 Correct 27 ms 976 KB Output is correct
96 Correct 18 ms 1024 KB Output is correct
97 Correct 29 ms 976 KB Output is correct
98 Correct 1 ms 512 KB Output is correct
99 Correct 80 ms 46908 KB Output is correct
100 Correct 54 ms 47016 KB Output is correct
101 Correct 69 ms 47096 KB Output is correct
102 Correct 65 ms 46984 KB Output is correct
103 Correct 67 ms 47532 KB Output is correct
104 Correct 62 ms 47992 KB Output is correct
105 Correct 1 ms 512 KB Output is correct
106 Correct 54 ms 27236 KB Output is correct
107 Correct 59 ms 47008 KB Output is correct
108 Correct 70 ms 47096 KB Output is correct
109 Correct 69 ms 47036 KB Output is correct
110 Correct 74 ms 47504 KB Output is correct
111 Correct 66 ms 47880 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 93 ms 37404 KB Output is correct
4 Correct 867 ms 47032 KB Output is correct
5 Correct 755 ms 23596 KB Output is correct
6 Correct 770 ms 46984 KB Output is correct
7 Correct 740 ms 32076 KB Output is correct
8 Correct 925 ms 47048 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 -