oj.uz

답안 #561392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
561392 2022-05-12T18:22:23 Z piOOE 밀림 점프 (APIO21_jumps) C++17
48 / 100
 1116 ms 48020 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 (jump[0][i] >= C && jump[0][i] < D) {
        return min(ans, nw + 1);
    } else if (h[jump[0][i]] < h[mxcd]) {
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 134 ms 37408 KB Output is correct
4 Correct 1006 ms 47024 KB Output is correct
5 Correct 759 ms 23588 KB Output is correct
6 Correct 887 ms 47012 KB Output is correct
7 Correct 760 ms 32072 KB Output is correct
8 Correct 1002 ms 47016 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 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 588 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 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 588 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 40 ms 37912 KB Output is correct
6 Correct 48 ms 47016 KB Output is correct
7 Correct 23 ms 24076 KB Output is correct
8 Correct 60 ms 46944 KB Output is correct
9 Correct 7 ms 7248 KB Output is correct
10 Correct 45 ms 47008 KB Output is correct
11 Correct 52 ms 47032 KB Output is correct
12 Correct 43 ms 47032 KB Output is correct
13 Correct 45 ms 47012 KB Output is correct
14 Correct 46 ms 47028 KB Output is correct
15 Incorrect 49 ms 47556 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 163 ms 21456 KB Output is correct
5 Correct 790 ms 46920 KB Output is correct
6 Correct 501 ms 7888 KB Output is correct
7 Correct 685 ms 47044 KB Output is correct
8 Correct 367 ms 16216 KB Output is correct
9 Correct 898 ms 47016 KB Output is correct
10 Correct 1000 ms 47136 KB Output is correct
11 Correct 1029 ms 47016 KB Output is correct
12 Correct 840 ms 47048 KB Output is correct
13 Correct 873 ms 46988 KB Output is correct
14 Correct 889 ms 47452 KB Output is correct
15 Correct 881 ms 47932 KB Output is correct
16 Correct 903 ms 47932 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 3 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 1 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 19 ms 976 KB Output is correct
30 Correct 17 ms 976 KB Output is correct
31 Correct 18 ms 928 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 25 ms 27120 KB Output is correct
34 Correct 47 ms 47136 KB Output is correct
35 Correct 42 ms 47020 KB Output is correct
36 Correct 61 ms 47012 KB Output is correct
37 Correct 44 ms 47484 KB Output is correct
38 Correct 45 ms 47908 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 163 ms 21456 KB Output is correct
5 Correct 790 ms 46920 KB Output is correct
6 Correct 501 ms 7888 KB Output is correct
7 Correct 685 ms 47044 KB Output is correct
8 Correct 367 ms 16216 KB Output is correct
9 Correct 898 ms 47016 KB Output is correct
10 Correct 1000 ms 47136 KB Output is correct
11 Correct 1029 ms 47016 KB Output is correct
12 Correct 840 ms 47048 KB Output is correct
13 Correct 873 ms 46988 KB Output is correct
14 Correct 889 ms 47452 KB Output is correct
15 Correct 881 ms 47932 KB Output is correct
16 Correct 903 ms 47932 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 3 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 1 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 19 ms 976 KB Output is correct
30 Correct 17 ms 976 KB Output is correct
31 Correct 18 ms 928 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 25 ms 27120 KB Output is correct
34 Correct 47 ms 47136 KB Output is correct
35 Correct 42 ms 47020 KB Output is correct
36 Correct 61 ms 47012 KB Output is correct
37 Correct 44 ms 47484 KB Output is correct
38 Correct 45 ms 47908 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 213 ms 21448 KB Output is correct
43 Correct 906 ms 47048 KB Output is correct
44 Correct 547 ms 7888 KB Output is correct
45 Correct 856 ms 46920 KB Output is correct
46 Correct 383 ms 16208 KB Output is correct
47 Correct 909 ms 47000 KB Output is correct
48 Correct 964 ms 47028 KB Output is correct
49 Correct 961 ms 47016 KB Output is correct
50 Correct 1044 ms 47048 KB Output is correct
51 Correct 986 ms 47032 KB Output is correct
52 Correct 932 ms 47660 KB Output is correct
53 Correct 830 ms 47988 KB Output is correct
54 Correct 793 ms 47912 KB Output is correct
55 Correct 1 ms 512 KB Output is correct
56 Correct 108 ms 46956 KB Output is correct
57 Correct 836 ms 47000 KB Output is correct
58 Correct 488 ms 8400 KB Output is correct
59 Correct 1058 ms 46964 KB Output is correct
60 Correct 370 ms 16720 KB Output is correct
61 Correct 653 ms 46968 KB Output is correct
62 Correct 1116 ms 46956 KB Output is correct
63 Correct 1022 ms 47024 KB Output is correct
64 Correct 977 ms 47212 KB Output is correct
65 Correct 1006 ms 46988 KB Output is correct
66 Correct 1020 ms 47524 KB Output is correct
67 Correct 876 ms 47956 KB Output is correct
68 Correct 787 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 4 ms 592 KB Output is correct
72 Correct 2 ms 592 KB Output is correct
73 Correct 3 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 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 2 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 4 ms 592 KB Output is correct
86 Correct 21 ms 976 KB Output is correct
87 Correct 21 ms 976 KB Output is correct
88 Correct 18 ms 976 KB Output is correct
89 Correct 19 ms 976 KB Output is correct
90 Correct 15 ms 1024 KB Output is correct
91 Correct 1 ms 592 KB Output is correct
92 Correct 1 ms 720 KB Output is correct
93 Correct 19 ms 976 KB Output is correct
94 Correct 28 ms 976 KB Output is correct
95 Correct 23 ms 976 KB Output is correct
96 Correct 23 ms 976 KB Output is correct
97 Correct 21 ms 976 KB Output is correct
98 Correct 0 ms 464 KB Output is correct
99 Correct 74 ms 47016 KB Output is correct
100 Correct 64 ms 47000 KB Output is correct
101 Correct 68 ms 47000 KB Output is correct
102 Correct 106 ms 47008 KB Output is correct
103 Correct 47 ms 47464 KB Output is correct
104 Correct 50 ms 47916 KB Output is correct
105 Correct 0 ms 464 KB Output is correct
106 Correct 36 ms 27172 KB Output is correct
107 Correct 50 ms 47012 KB Output is correct
108 Correct 56 ms 47016 KB Output is correct
109 Correct 57 ms 46984 KB Output is correct
110 Correct 53 ms 47548 KB Output is correct
111 Correct 87 ms 48020 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 134 ms 37408 KB Output is correct
4 Correct 1006 ms 47024 KB Output is correct
5 Correct 759 ms 23588 KB Output is correct
6 Correct 887 ms 47012 KB Output is correct
7 Correct 760 ms 32072 KB Output is correct
8 Correct 1002 ms 47016 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 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 588 KB Output isn't correct
14 Halted 0 ms 0 KB -