oj.uz

Submission #561384

# Submission time Handle Problem Language Result Execution time Memory
561384 2022-05-12T18:06:02 Z piOOE Rainforest Jumps (APIO21_jumps) C++17
60 / 100
 1136 ms 47956 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]) {
        assert(h[L[i]] >= h[C]);
        return 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 nw + 1;
    }
}

Compilation message

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:97:9: warning: unused variable 'ans' [-Wunused-variable]
   97 |     int ans = infI;
      |         ^~~

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 106 ms 37468 KB Output is correct
4 Correct 829 ms 46980 KB Output is correct
5 Correct 575 ms 23624 KB Output is correct
6 Correct 911 ms 46924 KB Output is correct
7 Correct 722 ms 32080 KB Output is correct
8 Correct 611 ms 47012 KB Output is correct

Subtask #2
0 / 8.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 1 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 0 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 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 1 ms 464 KB Output is correct
5 Correct 58 ms 37852 KB Output is correct
6 Correct 52 ms 46964 KB Output is correct
7 Correct 31 ms 24016 KB Output is correct
8 Correct 53 ms 47048 KB Output is correct
9 Correct 8 ms 7216 KB Output is correct
10 Correct 50 ms 47024 KB Output is correct
11 Correct 64 ms 47044 KB Output is correct
12 Correct 65 ms 47048 KB Output is correct
13 Correct 46 ms 47048 KB Output is correct
14 Correct 80 ms 47008 KB Output is correct
15 Correct 50 ms 47444 KB Output is correct
16 Correct 50 ms 47904 KB Output is correct
17 Correct 47 ms 47820 KB Output is correct
18 Correct 1 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 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 2 ms 976 KB Output is correct
31 Correct 1 ms 976 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 50 ms 47000 KB Output is correct
34 Correct 65 ms 47016 KB Output is correct
35 Correct 62 ms 46984 KB Output is correct
36 Correct 66 ms 47024 KB Output is correct
37 Correct 48 ms 47500 KB Output is correct
38 Correct 65 ms 47892 KB Output is correct
39 Correct 0 ms 464 KB Output is correct
40 Correct 41 ms 27172 KB Output is correct
41 Correct 52 ms 46932 KB Output is correct
42 Correct 48 ms 47012 KB Output is correct
43 Correct 53 ms 47012 KB Output is correct
44 Correct 53 ms 47532 KB Output is correct
45 Correct 76 ms 47908 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 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 196 ms 21516 KB Output is correct
5 Correct 964 ms 47008 KB Output is correct
6 Correct 561 ms 7888 KB Output is correct
7 Correct 908 ms 46956 KB Output is correct
8 Correct 595 ms 16160 KB Output is correct
9 Correct 923 ms 47032 KB Output is correct
10 Correct 836 ms 46920 KB Output is correct
11 Correct 1136 ms 47016 KB Output is correct
12 Correct 992 ms 46968 KB Output is correct
13 Correct 982 ms 46996 KB Output is correct
14 Correct 989 ms 47476 KB Output is correct
15 Correct 785 ms 47956 KB Output is correct
16 Correct 979 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 2 ms 592 KB Output is correct
21 Correct 2 ms 592 KB Output is correct
22 Correct 3 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 720 KB Output is correct
27 Correct 23 ms 976 KB Output is correct
28 Correct 19 ms 976 KB Output is correct
29 Correct 18 ms 976 KB Output is correct
30 Correct 24 ms 976 KB Output is correct
31 Correct 21 ms 976 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 42 ms 27204 KB Output is correct
34 Correct 54 ms 47012 KB Output is correct
35 Correct 62 ms 46920 KB Output is correct
36 Correct 49 ms 46960 KB Output is correct
37 Correct 43 ms 47516 KB Output is correct
38 Correct 48 ms 47928 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 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 196 ms 21516 KB Output is correct
5 Correct 964 ms 47008 KB Output is correct
6 Correct 561 ms 7888 KB Output is correct
7 Correct 908 ms 46956 KB Output is correct
8 Correct 595 ms 16160 KB Output is correct
9 Correct 923 ms 47032 KB Output is correct
10 Correct 836 ms 46920 KB Output is correct
11 Correct 1136 ms 47016 KB Output is correct
12 Correct 992 ms 46968 KB Output is correct
13 Correct 982 ms 46996 KB Output is correct
14 Correct 989 ms 47476 KB Output is correct
15 Correct 785 ms 47956 KB Output is correct
16 Correct 979 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 2 ms 592 KB Output is correct
21 Correct 2 ms 592 KB Output is correct
22 Correct 3 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 720 KB Output is correct
27 Correct 23 ms 976 KB Output is correct
28 Correct 19 ms 976 KB Output is correct
29 Correct 18 ms 976 KB Output is correct
30 Correct 24 ms 976 KB Output is correct
31 Correct 21 ms 976 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 42 ms 27204 KB Output is correct
34 Correct 54 ms 47012 KB Output is correct
35 Correct 62 ms 46920 KB Output is correct
36 Correct 49 ms 46960 KB Output is correct
37 Correct 43 ms 47516 KB Output is correct
38 Correct 48 ms 47928 KB Output is correct
39 Correct 0 ms 464 KB Output is correct
40 Correct 0 ms 464 KB Output is correct
41 Correct 0 ms 464 KB Output is correct
42 Correct 235 ms 21476 KB Output is correct
43 Correct 854 ms 47040 KB Output is correct
44 Correct 569 ms 7888 KB Output is correct
45 Correct 619 ms 47052 KB Output is correct
46 Correct 543 ms 16208 KB Output is correct
47 Correct 920 ms 47008 KB Output is correct
48 Correct 670 ms 46920 KB Output is correct
49 Correct 899 ms 47120 KB Output is correct
50 Correct 915 ms 47048 KB Output is correct
51 Correct 765 ms 46920 KB Output is correct
52 Correct 998 ms 47528 KB Output is correct
53 Correct 897 ms 47896 KB Output is correct
54 Correct 863 ms 47932 KB Output is correct
55 Correct 1 ms 464 KB Output is correct
56 Correct 95 ms 46900 KB Output is correct
57 Correct 706 ms 46976 KB Output is correct
58 Correct 427 ms 8392 KB Output is correct
59 Correct 842 ms 47004 KB Output is correct
60 Correct 438 ms 16672 KB Output is correct
61 Correct 834 ms 47008 KB Output is correct
62 Correct 798 ms 47028 KB Output is correct
63 Correct 979 ms 46956 KB Output is correct
64 Correct 1024 ms 46932 KB Output is correct
65 Correct 907 ms 47052 KB Output is correct
66 Correct 799 ms 47540 KB Output is correct
67 Correct 808 ms 47932 KB Output is correct
68 Correct 656 ms 47932 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 3 ms 592 KB Output is correct
73 Correct 2 ms 592 KB Output is correct
74 Correct 3 ms 592 KB Output is correct
75 Correct 2 ms 592 KB Output is correct
76 Correct 1 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 1 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 3 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 19 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 16 ms 976 KB Output is correct
90 Correct 17 ms 976 KB Output is correct
91 Correct 1 ms 592 KB Output is correct
92 Correct 2 ms 720 KB Output is correct
93 Correct 16 ms 976 KB Output is correct
94 Correct 17 ms 976 KB Output is correct
95 Correct 10 ms 976 KB Output is correct
96 Correct 22 ms 976 KB Output is correct
97 Correct 16 ms 976 KB Output is correct
98 Correct 0 ms 464 KB Output is correct
99 Correct 47 ms 47016 KB Output is correct
100 Correct 47 ms 47048 KB Output is correct
101 Correct 42 ms 46996 KB Output is correct
102 Correct 45 ms 46976 KB Output is correct
103 Correct 43 ms 47532 KB Output is correct
104 Correct 44 ms 47896 KB Output is correct
105 Correct 1 ms 464 KB Output is correct
106 Correct 28 ms 27168 KB Output is correct
107 Correct 52 ms 47012 KB Output is correct
108 Correct 45 ms 47016 KB Output is correct
109 Correct 46 ms 46992 KB Output is correct
110 Correct 45 ms 47552 KB Output is correct
111 Correct 61 ms 47932 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 106 ms 37468 KB Output is correct
4 Correct 829 ms 46980 KB Output is correct
5 Correct 575 ms 23624 KB Output is correct
6 Correct 911 ms 46924 KB Output is correct
7 Correct 722 ms 32080 KB Output is correct
8 Correct 611 ms 47012 KB Output is correct
9 Correct 0 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 0 ms 464 KB Output is correct
13 Incorrect 2 ms 464 KB Output isn't correct
14 Halted 0 ms 0 KB -