oj.uz

Submission #561378

# Submission time Handle Problem Language Result Execution time Memory
561378 2022-05-12T17:40:46 Z piOOE Rainforest Jumps (APIO21_jumps) C++17
60 / 100
 1288 ms 47980 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 = 0;
    for (int j = logn - 1; j > -1; --j) {
        if (jump[j][i] == -1 || h[jump[j][i]] >= h[C]) continue;
        ans += (1 << j);
        i = jump[j][i];
    }
    assert(L[i] != C);
    assert(i < C);
    int nw = ans;
    if (R[i] >= C && R[i] < D) {
        return ans + 1;
    }
    else {
        if (L[i] != -1 && h[L[i]] < h[mxcd]) {
            ans = nw + 2;
        } else {
            ans = infI;
        }
    }
    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 114 ms 37408 KB Output is correct
4 Correct 877 ms 46952 KB Output is correct
5 Correct 693 ms 23588 KB Output is correct
6 Correct 787 ms 47052 KB Output is correct
7 Correct 626 ms 32128 KB Output is correct
8 Correct 771 ms 47012 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 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Incorrect 3 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 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Incorrect 3 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 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 Correct 40 ms 37920 KB Output is correct
6 Correct 48 ms 47000 KB Output is correct
7 Correct 26 ms 24036 KB Output is correct
8 Correct 56 ms 47016 KB Output is correct
9 Correct 10 ms 7248 KB Output is correct
10 Correct 63 ms 47008 KB Output is correct
11 Correct 44 ms 47008 KB Output is correct
12 Correct 45 ms 47140 KB Output is correct
13 Correct 49 ms 46928 KB Output is correct
14 Correct 46 ms 47028 KB Output is correct
15 Correct 68 ms 47452 KB Output is correct
16 Correct 50 ms 47780 KB Output is correct
17 Correct 45 ms 47772 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 1 ms 592 KB Output is correct
20 Correct 0 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 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 2 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 0 ms 464 KB Output is correct
33 Correct 54 ms 47024 KB Output is correct
34 Correct 50 ms 47048 KB Output is correct
35 Correct 47 ms 47000 KB Output is correct
36 Correct 50 ms 47000 KB Output is correct
37 Correct 47 ms 47464 KB Output is correct
38 Correct 65 ms 47932 KB Output is correct
39 Correct 0 ms 464 KB Output is correct
40 Correct 30 ms 27172 KB Output is correct
41 Correct 51 ms 47012 KB Output is correct
42 Correct 47 ms 47016 KB Output is correct
43 Correct 51 ms 47032 KB Output is correct
44 Correct 44 ms 47528 KB Output is correct
45 Correct 46 ms 47932 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 247 ms 21508 KB Output is correct
5 Correct 769 ms 47012 KB Output is correct
6 Correct 489 ms 7864 KB Output is correct
7 Correct 702 ms 47008 KB Output is correct
8 Correct 494 ms 16208 KB Output is correct
9 Correct 852 ms 46920 KB Output is correct
10 Correct 802 ms 47032 KB Output is correct
11 Correct 980 ms 47036 KB Output is correct
12 Correct 934 ms 47052 KB Output is correct
13 Correct 995 ms 47048 KB Output is correct
14 Correct 1182 ms 47552 KB Output is correct
15 Correct 895 ms 47932 KB Output is correct
16 Correct 930 ms 47920 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 564 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 2 ms 592 KB Output is correct
23 Correct 4 ms 536 KB Output is correct
24 Correct 2 ms 592 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 2 ms 768 KB Output is correct
27 Correct 24 ms 976 KB Output is correct
28 Correct 25 ms 976 KB Output is correct
29 Correct 24 ms 976 KB Output is correct
30 Correct 19 ms 976 KB Output is correct
31 Correct 30 ms 976 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 32 ms 27176 KB Output is correct
34 Correct 51 ms 47048 KB Output is correct
35 Correct 61 ms 47004 KB Output is correct
36 Correct 69 ms 47004 KB Output is correct
37 Correct 54 ms 47552 KB Output is correct
38 Correct 52 ms 47920 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 247 ms 21508 KB Output is correct
5 Correct 769 ms 47012 KB Output is correct
6 Correct 489 ms 7864 KB Output is correct
7 Correct 702 ms 47008 KB Output is correct
8 Correct 494 ms 16208 KB Output is correct
9 Correct 852 ms 46920 KB Output is correct
10 Correct 802 ms 47032 KB Output is correct
11 Correct 980 ms 47036 KB Output is correct
12 Correct 934 ms 47052 KB Output is correct
13 Correct 995 ms 47048 KB Output is correct
14 Correct 1182 ms 47552 KB Output is correct
15 Correct 895 ms 47932 KB Output is correct
16 Correct 930 ms 47920 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 564 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 2 ms 592 KB Output is correct
23 Correct 4 ms 536 KB Output is correct
24 Correct 2 ms 592 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 2 ms 768 KB Output is correct
27 Correct 24 ms 976 KB Output is correct
28 Correct 25 ms 976 KB Output is correct
29 Correct 24 ms 976 KB Output is correct
30 Correct 19 ms 976 KB Output is correct
31 Correct 30 ms 976 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 32 ms 27176 KB Output is correct
34 Correct 51 ms 47048 KB Output is correct
35 Correct 61 ms 47004 KB Output is correct
36 Correct 69 ms 47004 KB Output is correct
37 Correct 54 ms 47552 KB Output is correct
38 Correct 52 ms 47920 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 272 ms 21452 KB Output is correct
43 Correct 1061 ms 47028 KB Output is correct
44 Correct 573 ms 7968 KB Output is correct
45 Correct 1090 ms 47040 KB Output is correct
46 Correct 502 ms 16208 KB Output is correct
47 Correct 763 ms 47000 KB Output is correct
48 Correct 746 ms 47036 KB Output is correct
49 Correct 1087 ms 47008 KB Output is correct
50 Correct 1254 ms 47000 KB Output is correct
51 Correct 911 ms 47008 KB Output is correct
52 Correct 1137 ms 47540 KB Output is correct
53 Correct 1036 ms 47860 KB Output is correct
54 Correct 950 ms 47912 KB Output is correct
55 Correct 1 ms 464 KB Output is correct
56 Correct 128 ms 46928 KB Output is correct
57 Correct 1181 ms 47032 KB Output is correct
58 Correct 409 ms 8428 KB Output is correct
59 Correct 1111 ms 47028 KB Output is correct
60 Correct 384 ms 16672 KB Output is correct
61 Correct 949 ms 47028 KB Output is correct
62 Correct 801 ms 47048 KB Output is correct
63 Correct 1004 ms 47036 KB Output is correct
64 Correct 1288 ms 47000 KB Output is correct
65 Correct 853 ms 47028 KB Output is correct
66 Correct 1170 ms 47548 KB Output is correct
67 Correct 1147 ms 47948 KB Output is correct
68 Correct 1100 ms 47948 KB Output is correct
69 Correct 1 ms 512 KB Output is correct
70 Correct 1 ms 512 KB Output is correct
71 Correct 3 ms 628 KB Output is correct
72 Correct 2 ms 640 KB Output is correct
73 Correct 3 ms 640 KB Output is correct
74 Correct 3 ms 592 KB Output is correct
75 Correct 4 ms 592 KB Output is correct
76 Correct 1 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 3 ms 640 KB Output is correct
80 Correct 4 ms 592 KB Output is correct
81 Correct 4 ms 640 KB Output is correct
82 Correct 4 ms 592 KB Output is correct
83 Correct 5 ms 516 KB Output is correct
84 Correct 1 ms 640 KB Output is correct
85 Correct 2 ms 640 KB Output is correct
86 Correct 27 ms 976 KB Output is correct
87 Correct 25 ms 1024 KB Output is correct
88 Correct 24 ms 976 KB Output is correct
89 Correct 25 ms 1012 KB Output is correct
90 Correct 25 ms 976 KB Output is correct
91 Correct 1 ms 640 KB Output is correct
92 Correct 2 ms 720 KB Output is correct
93 Correct 28 ms 976 KB Output is correct
94 Correct 14 ms 1020 KB Output is correct
95 Correct 14 ms 1024 KB Output is correct
96 Correct 23 ms 976 KB Output is correct
97 Correct 19 ms 1076 KB Output is correct
98 Correct 1 ms 512 KB Output is correct
99 Correct 90 ms 46928 KB Output is correct
100 Correct 62 ms 47028 KB Output is correct
101 Correct 63 ms 47036 KB Output is correct
102 Correct 71 ms 47036 KB Output is correct
103 Correct 59 ms 47536 KB Output is correct
104 Correct 59 ms 47980 KB Output is correct
105 Correct 1 ms 500 KB Output is correct
106 Correct 40 ms 27180 KB Output is correct
107 Correct 85 ms 46940 KB Output is correct
108 Correct 63 ms 47032 KB Output is correct
109 Correct 67 ms 47040 KB Output is correct
110 Correct 75 ms 47560 KB Output is correct
111 Correct 75 ms 47936 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 114 ms 37408 KB Output is correct
4 Correct 877 ms 46952 KB Output is correct
5 Correct 693 ms 23588 KB Output is correct
6 Correct 787 ms 47052 KB Output is correct
7 Correct 626 ms 32128 KB Output is correct
8 Correct 771 ms 47012 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 0 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 3 ms 464 KB Output isn't correct
14 Halted 0 ms 0 KB -