oj.uz

Submission #561391

# Submission time Handle Problem Language Result Execution time Memory
561391 2022-05-12T18:12:54 Z piOOE Rainforest Jumps (APIO21_jumps) C++17
60 / 100
 1142 ms 47932 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;


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];
    }
    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) {
    ++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) continue;
        if (jump[j][i] >= C && jump[j][i] < D) {
            ans = min(ans, nw + (1 << j));
        } else if (h[jump[j][i]] >= h[C] && h[jump[j][i]] < h[mxcd]) {
            assert(jump[j][i] < C);
            ans = min(ans, nw + (1 << j) + 1);
        }
        if (h[jump[j][i]] < h[C]) {
            nw += (1 << j);
            i = jump[j][i];
        }
    }
    assert(L[i] != C);
    assert(i < C);
    if (R[i] >= C && R[i] < D) {
        return min(ans, nw + 1);
    } else if (L[i] != -1 && h[L[i]] < h[mxcd]) {
        assert(h[L[i]] >= h[C]);
        return min(ans, nw + 2);
    } else {
        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 0 ms 464 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 165 ms 37392 KB Output is correct
4 Correct 1091 ms 47036 KB Output is correct
5 Correct 954 ms 23672 KB Output is correct
6 Correct 1140 ms 47012 KB Output is correct
7 Correct 684 ms 32072 KB Output is correct
8 Correct 1142 ms 47016 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 0 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 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 0 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 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 0 ms 464 KB Output is correct
5 Correct 43 ms 37856 KB Output is correct
6 Correct 52 ms 46944 KB Output is correct
7 Correct 26 ms 24076 KB Output is correct
8 Correct 48 ms 46924 KB Output is correct
9 Correct 10 ms 7256 KB Output is correct
10 Correct 65 ms 47024 KB Output is correct
11 Correct 43 ms 47032 KB Output is correct
12 Correct 46 ms 46996 KB Output is correct
13 Correct 46 ms 47012 KB Output is correct
14 Correct 48 ms 46952 KB Output is correct
15 Correct 52 ms 47520 KB Output is correct
16 Correct 67 ms 47788 KB Output is correct
17 Correct 51 ms 47916 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 0 ms 592 KB Output is correct
20 Correct 1 ms 592 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 592 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 0 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 3 ms 976 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 68 ms 47012 KB Output is correct
34 Correct 63 ms 47004 KB Output is correct
35 Correct 46 ms 47032 KB Output is correct
36 Correct 45 ms 47036 KB Output is correct
37 Correct 47 ms 47536 KB Output is correct
38 Correct 66 ms 47912 KB Output is correct
39 Correct 0 ms 464 KB Output is correct
40 Correct 27 ms 27144 KB Output is correct
41 Correct 49 ms 47016 KB Output is correct
42 Correct 45 ms 47000 KB Output is correct
43 Correct 49 ms 47044 KB Output is correct
44 Correct 43 ms 47564 KB Output is correct
45 Correct 61 ms 47932 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 141 ms 21404 KB Output is correct
5 Correct 775 ms 47028 KB Output is correct
6 Correct 541 ms 7888 KB Output is correct
7 Correct 964 ms 47136 KB Output is correct
8 Correct 457 ms 16208 KB Output is correct
9 Correct 566 ms 47036 KB Output is correct
10 Correct 1041 ms 47036 KB Output is correct
11 Correct 996 ms 46920 KB Output is correct
12 Correct 1037 ms 47152 KB Output is correct
13 Correct 851 ms 47032 KB Output is correct
14 Correct 1049 ms 47504 KB Output is correct
15 Correct 850 ms 47856 KB Output is correct
16 Correct 853 ms 47892 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 2 ms 592 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 2 ms 592 KB Output is correct
24 Correct 2 ms 592 KB Output is correct
25 Correct 0 ms 592 KB Output is correct
26 Correct 1 ms 720 KB Output is correct
27 Correct 19 ms 976 KB Output is correct
28 Correct 19 ms 976 KB Output is correct
29 Correct 19 ms 976 KB Output is correct
30 Correct 16 ms 976 KB Output is correct
31 Correct 16 ms 976 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 27 ms 27168 KB Output is correct
34 Correct 49 ms 46984 KB Output is correct
35 Correct 46 ms 47012 KB Output is correct
36 Correct 46 ms 47012 KB Output is correct
37 Correct 44 ms 47536 KB Output is correct
38 Correct 57 ms 47932 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 141 ms 21404 KB Output is correct
5 Correct 775 ms 47028 KB Output is correct
6 Correct 541 ms 7888 KB Output is correct
7 Correct 964 ms 47136 KB Output is correct
8 Correct 457 ms 16208 KB Output is correct
9 Correct 566 ms 47036 KB Output is correct
10 Correct 1041 ms 47036 KB Output is correct
11 Correct 996 ms 46920 KB Output is correct
12 Correct 1037 ms 47152 KB Output is correct
13 Correct 851 ms 47032 KB Output is correct
14 Correct 1049 ms 47504 KB Output is correct
15 Correct 850 ms 47856 KB Output is correct
16 Correct 853 ms 47892 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 2 ms 592 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 2 ms 592 KB Output is correct
24 Correct 2 ms 592 KB Output is correct
25 Correct 0 ms 592 KB Output is correct
26 Correct 1 ms 720 KB Output is correct
27 Correct 19 ms 976 KB Output is correct
28 Correct 19 ms 976 KB Output is correct
29 Correct 19 ms 976 KB Output is correct
30 Correct 16 ms 976 KB Output is correct
31 Correct 16 ms 976 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 27 ms 27168 KB Output is correct
34 Correct 49 ms 46984 KB Output is correct
35 Correct 46 ms 47012 KB Output is correct
36 Correct 46 ms 47012 KB Output is correct
37 Correct 44 ms 47536 KB Output is correct
38 Correct 57 ms 47932 KB Output is correct
39 Correct 0 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 225 ms 21412 KB Output is correct
43 Correct 819 ms 46920 KB Output is correct
44 Correct 516 ms 7888 KB Output is correct
45 Correct 835 ms 46992 KB Output is correct
46 Correct 454 ms 16220 KB Output is correct
47 Correct 869 ms 47012 KB Output is correct
48 Correct 1029 ms 46996 KB Output is correct
49 Correct 1037 ms 47016 KB Output is correct
50 Correct 907 ms 47012 KB Output is correct
51 Correct 899 ms 46964 KB Output is correct
52 Correct 962 ms 47540 KB Output is correct
53 Correct 751 ms 47880 KB Output is correct
54 Correct 744 ms 47912 KB Output is correct
55 Correct 0 ms 464 KB Output is correct
56 Correct 97 ms 46896 KB Output is correct
57 Correct 627 ms 47012 KB Output is correct
58 Correct 426 ms 8400 KB Output is correct
59 Correct 890 ms 47048 KB Output is correct
60 Correct 344 ms 16724 KB Output is correct
61 Correct 780 ms 46948 KB Output is correct
62 Correct 885 ms 47012 KB Output is correct
63 Correct 1039 ms 47000 KB Output is correct
64 Correct 746 ms 47040 KB Output is correct
65 Correct 885 ms 47012 KB Output is correct
66 Correct 892 ms 47548 KB Output is correct
67 Correct 768 ms 47884 KB Output is correct
68 Correct 708 ms 47896 KB Output is correct
69 Correct 0 ms 464 KB Output is correct
70 Correct 1 ms 464 KB Output is correct
71 Correct 2 ms 592 KB Output is correct
72 Correct 2 ms 492 KB Output is correct
73 Correct 2 ms 592 KB Output is correct
74 Correct 2 ms 592 KB Output is correct
75 Correct 2 ms 592 KB Output is correct
76 Correct 0 ms 464 KB Output is correct
77 Correct 0 ms 464 KB Output is correct
78 Correct 2 ms 464 KB Output is correct
79 Correct 3 ms 592 KB Output is correct
80 Correct 2 ms 592 KB Output is correct
81 Correct 2 ms 592 KB Output is correct
82 Correct 3 ms 592 KB Output is correct
83 Correct 1 ms 592 KB Output is correct
84 Correct 0 ms 592 KB Output is correct
85 Correct 3 ms 592 KB Output is correct
86 Correct 17 ms 976 KB Output is correct
87 Correct 18 ms 976 KB Output is correct
88 Correct 20 ms 976 KB Output is correct
89 Correct 15 ms 976 KB Output is correct
90 Correct 18 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 20 ms 976 KB Output is correct
94 Correct 17 ms 976 KB Output is correct
95 Correct 17 ms 976 KB Output is correct
96 Correct 16 ms 976 KB Output is correct
97 Correct 9 ms 976 KB Output is correct
98 Correct 0 ms 464 KB Output is correct
99 Correct 47 ms 46996 KB Output is correct
100 Correct 62 ms 47032 KB Output is correct
101 Correct 44 ms 47048 KB Output is correct
102 Correct 47 ms 47012 KB Output is correct
103 Correct 46 ms 47556 KB Output is correct
104 Correct 45 ms 47932 KB Output is correct
105 Correct 0 ms 464 KB Output is correct
106 Correct 27 ms 27144 KB Output is correct
107 Correct 48 ms 46928 KB Output is correct
108 Correct 47 ms 47016 KB Output is correct
109 Correct 48 ms 46920 KB Output is correct
110 Correct 46 ms 47544 KB Output is correct
111 Correct 43 ms 47880 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 165 ms 37392 KB Output is correct
4 Correct 1091 ms 47036 KB Output is correct
5 Correct 954 ms 23672 KB Output is correct
6 Correct 1140 ms 47012 KB Output is correct
7 Correct 684 ms 32072 KB Output is correct
8 Correct 1142 ms 47016 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 0 ms 464 KB Output is correct
11 Correct 0 ms 464 KB Output is correct
12 Correct 0 ms 464 KB Output is correct
13 Incorrect 2 ms 464 KB Output isn't correct
14 Halted 0 ms 0 KB -