oj.uz

Submission #561372

# Submission time Handle Problem Language Result Execution time Memory
561372 2022-05-12T17:23:48 Z piOOE Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1118 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;

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);
    for (int j = logn - 1; j > -1; --j) {
        if (jmp[j][i] < C) {
            ans += (1 << j);
            i = jmp[j][i];
        }
    }
    assert(R[i] == C);
    return ans + 1;

}

Subtask #1
4.0 / 4.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 102 ms 37404 KB Output is correct
4 Correct 825 ms 47012 KB Output is correct
5 Correct 754 ms 23612 KB Output is correct
6 Correct 813 ms 47028 KB Output is correct
7 Correct 727 ms 32076 KB Output is correct
8 Correct 853 ms 47028 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 848 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 848 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 848 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.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 226 ms 21512 KB Output is correct
5 Correct 869 ms 47008 KB Output is correct
6 Correct 644 ms 7888 KB Output is correct
7 Correct 943 ms 47032 KB Output is correct
8 Correct 543 ms 16188 KB Output is correct
9 Correct 651 ms 46996 KB Output is correct
10 Correct 734 ms 46920 KB Output is correct
11 Correct 849 ms 46972 KB Output is correct
12 Correct 1056 ms 47024 KB Output is correct
13 Correct 810 ms 47016 KB Output is correct
14 Correct 1100 ms 47536 KB Output is correct
15 Correct 712 ms 47932 KB Output is correct
16 Correct 932 ms 47916 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 2 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 3 ms 592 KB Output is correct
24 Correct 3 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 18 ms 976 KB Output is correct
28 Correct 18 ms 976 KB Output is correct
29 Correct 22 ms 1024 KB Output is correct
30 Correct 24 ms 976 KB Output is correct
31 Correct 17 ms 976 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 28 ms 27152 KB Output is correct
34 Correct 62 ms 47036 KB Output is correct
35 Correct 48 ms 47008 KB Output is correct
36 Correct 54 ms 47008 KB Output is correct
37 Correct 47 ms 47456 KB Output is correct
38 Correct 50 ms 47916 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 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 226 ms 21512 KB Output is correct
5 Correct 869 ms 47008 KB Output is correct
6 Correct 644 ms 7888 KB Output is correct
7 Correct 943 ms 47032 KB Output is correct
8 Correct 543 ms 16188 KB Output is correct
9 Correct 651 ms 46996 KB Output is correct
10 Correct 734 ms 46920 KB Output is correct
11 Correct 849 ms 46972 KB Output is correct
12 Correct 1056 ms 47024 KB Output is correct
13 Correct 810 ms 47016 KB Output is correct
14 Correct 1100 ms 47536 KB Output is correct
15 Correct 712 ms 47932 KB Output is correct
16 Correct 932 ms 47916 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 2 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 3 ms 592 KB Output is correct
24 Correct 3 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 18 ms 976 KB Output is correct
28 Correct 18 ms 976 KB Output is correct
29 Correct 22 ms 1024 KB Output is correct
30 Correct 24 ms 976 KB Output is correct
31 Correct 17 ms 976 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 28 ms 27152 KB Output is correct
34 Correct 62 ms 47036 KB Output is correct
35 Correct 48 ms 47008 KB Output is correct
36 Correct 54 ms 47008 KB Output is correct
37 Correct 47 ms 47456 KB Output is correct
38 Correct 50 ms 47916 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 242 ms 21404 KB Output is correct
43 Correct 757 ms 47028 KB Output is correct
44 Correct 599 ms 7888 KB Output is correct
45 Correct 932 ms 46956 KB Output is correct
46 Correct 457 ms 16168 KB Output is correct
47 Correct 932 ms 47008 KB Output is correct
48 Correct 844 ms 47044 KB Output is correct
49 Correct 1072 ms 47008 KB Output is correct
50 Correct 919 ms 46928 KB Output is correct
51 Correct 957 ms 46920 KB Output is correct
52 Correct 1117 ms 47512 KB Output is correct
53 Correct 851 ms 47920 KB Output is correct
54 Correct 878 ms 47932 KB Output is correct
55 Correct 1 ms 464 KB Output is correct
56 Correct 105 ms 46920 KB Output is correct
57 Correct 943 ms 46996 KB Output is correct
58 Correct 379 ms 8400 KB Output is correct
59 Correct 848 ms 47008 KB Output is correct
60 Correct 393 ms 16624 KB Output is correct
61 Correct 910 ms 46924 KB Output is correct
62 Correct 782 ms 47036 KB Output is correct
63 Correct 1118 ms 47032 KB Output is correct
64 Correct 1010 ms 47068 KB Output is correct
65 Correct 667 ms 46980 KB Output is correct
66 Correct 971 ms 47444 KB Output is correct
67 Correct 898 ms 47896 KB Output is correct
68 Correct 701 ms 47928 KB Output is correct
69 Correct 1 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 4 ms 592 KB Output is correct
74 Correct 2 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 2 ms 592 KB Output is correct
80 Correct 3 ms 592 KB Output is correct
81 Correct 3 ms 592 KB Output is correct
82 Correct 3 ms 592 KB Output is correct
83 Correct 4 ms 592 KB Output is correct
84 Correct 1 ms 520 KB Output is correct
85 Correct 5 ms 592 KB Output is correct
86 Correct 18 ms 976 KB Output is correct
87 Correct 19 ms 976 KB Output is correct
88 Correct 15 ms 976 KB Output is correct
89 Correct 19 ms 976 KB Output is correct
90 Correct 19 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 13 ms 976 KB Output is correct
94 Correct 19 ms 940 KB Output is correct
95 Correct 22 ms 976 KB Output is correct
96 Correct 17 ms 976 KB Output is correct
97 Correct 19 ms 976 KB Output is correct
98 Correct 0 ms 464 KB Output is correct
99 Correct 67 ms 47000 KB Output is correct
100 Correct 62 ms 46920 KB Output is correct
101 Correct 46 ms 47028 KB Output is correct
102 Correct 54 ms 46992 KB Output is correct
103 Correct 47 ms 47536 KB Output is correct
104 Correct 64 ms 47916 KB Output is correct
105 Correct 0 ms 464 KB Output is correct
106 Correct 29 ms 27152 KB Output is correct
107 Correct 48 ms 47000 KB Output is correct
108 Correct 46 ms 47012 KB Output is correct
109 Correct 57 ms 47028 KB Output is correct
110 Correct 56 ms 47540 KB Output is correct
111 Correct 59 ms 47856 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 0 ms 464 KB Output is correct
3 Correct 102 ms 37404 KB Output is correct
4 Correct 825 ms 47012 KB Output is correct
5 Correct 754 ms 23612 KB Output is correct
6 Correct 813 ms 47028 KB Output is correct
7 Correct 727 ms 32076 KB Output is correct
8 Correct 853 ms 47028 KB Output is correct
9 Runtime error 2 ms 848 KB Execution killed with signal 6
10 Halted 0 ms 0 KB -