oj.uz

답안 #478312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
478312 2021-10-07T02:06:44 Z khoabright 밀림 점프 (APIO21_jumps) C++17
48 / 100
 1491 ms 66240 KB 
#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define rep1(i, a, b) for (int i = (int)a; i >= (int)b; --i)
#define mp make_pair

const int N = 2e5 + 5;
const int k = 19;

int L[N][20], R[N][20], higher[N][20], h[N], f[N][20];
int my_size;
bool sub1 = 1;

void cal_LR() {
    rep(i, 1, my_size) if (h[i] != i) {
        sub1 = 0;
        break;
    }
    
    stack<int> st;

    rep(i, 1, my_size) {
        while (!st.empty() && h[st.top()] < h[i]) st.pop();
        if (!st.empty()) L[i][0] = st.top();

        st.push(i);
    }

    while (!st.empty()) st.pop();

    rep1(i, my_size, 1) {
        while (!st.empty() && h[st.top()] < h[i]) st.pop();
        if (!st.empty()) R[i][0] = st.top();

        st.push(i);
    }

    rep(i, 1, my_size) {
        if (h[L[i][0]] > h[R[i][0]]) higher[i][0] = L[i][0];
        else higher[i][0] = R[i][0];
        if (h[higher[i][0]] < h[i]) higher[i][0] = 0;
    }

    rep(u, 1, k) {
        rep(i, 1, my_size) {
            L[i][u] = L[L[i][u - 1]][u - 1];
            R[i][u] = R[R[i][u - 1]][u - 1];
            higher[i][u] = higher[higher[i][u - 1]][u - 1];
        }
    }

    rep(i, 1, my_size) {
        f[i][0] = h[i];
    }

    rep(u, 1, k) {
        int tmp = N - (1 << u) + 1;
        rep(i, 1, tmp - 1) {
            f[i][u] = max(f[i][u - 1], f[i + (1 << (u - 1))][u - 1]);
        }
    }
}

int get_max(int l, int r) {
    int k = log2(r - l + 1);
    return max(f[l][k],f[r - (1 << k) + 1][k]);
}

int minimum_jumps_sub1234(int a, int b, int c, int d) {
    if (sub1) return c - b;
    ++a, ++b, ++c, ++d;
    queue<pii> q;
    vector<bool> vst(my_size + 1);
    vst[0] = 1;

    rep(i, a, b) q.push({i, 0}), vst[i] = 1;

    while (!q.empty()) {
        auto [u, w] = q.front();
        q.pop();
        if (c <= u && u <= d) return w;
        int v = L[u][0];
        if (!vst[v]) {
            q.push({v, w + 1});
            vst[v] = 1;
        }
        v = R[u][0];
        if (!vst[v]) {
            q.push({v, w + 1});
            vst[v] = 1;
        }
    }

    return -1;
}

int minimum_jumps_sub5(int s, int t) {
    ++s, ++t;
 
    int ans = 0;
     //cout << "s,t="<<s<<' '<<t<<'\n';
    // cout << "H,L,R="<<higher[s][0] << ' ' << L[s][0] << ' ' << R[s][0] <<' '<<
    //' '<<higher[t][0]<<' '<<L[t][0]<<' '<<R[t][0]<< '\n';
    rep1(u, k, 0) {
        if (higher[s][u] != 0 && h[higher[s][u]] < h[t]) {
            //cout<<"u,higher="<<u<<' '<<higher[s][u]<<'\n';
            ans += (1 << u);
            s = higher[s][u];
        }
    }

    //cout<<"s,ans="<<s<<' '<<ans<<'\n';

    //if (s != t) {
        //cout << "s,ans,R0="<<s<<' '<<ans<<' '<<R[s][0]<<'\n';
        rep1(u, k, 0) {
            if (R[s][u] != 0 && h[R[s][u]] < h[t]) {
                ans += (1 << u);
                s = R[s][u];
            }
        }
    //}
    if (R[s][0] != t) {
        return -1;
    }
    else return ans + 1;
}

int minimum_jumps_sub7(int a, int b, int c, int d) {
    ++a, ++b, ++c, ++d;

    //cout<<"b,L="<<b<<' '<<L[b][0]<<'\n';
    int maxi = get_max(c, d);
    if (h[b] > maxi) return -1;
    rep1(u, k, 0) {
        if (L[b][u] >= a && h[L[b][u]] <= maxi) {
            b = L[b][u];
        }
    }

    rep1(u, k, 0) {
        if (R[c][u] != 0 && R[c][u] <= d && h[R[c][u]] < h[b]) {
            c = R[c][u];
        }
    }
    if (h[c] < h[b]) c = R[c][0];

    return minimum_jumps_sub5(b - 1, c - 1);
} 

int minimum_jumps(int a, int b, int c, int d) {
    return minimum_jumps_sub7(a, b, c, d);
}

void init(int sz, vector<int> array) {
    my_size = sz;
    rep(i, 1, my_size) h[i] = array[i - 1];   
    cal_LR();
}

// int main() {
//     // ios_base::sync_with_stdio(0);
//     // cin.tie(0); cout.tie(0);

//     int x; cin >> x;
//     vector<int> array(x);
//     rep(i, 1, x) cin >> array[i - 1];
//     init(x,array);

//     //rep(i, 1, my_size) cout << L[i] << ' ' << R[i]<< '\n';

//     int q; cin >> q;
//     while (q--) {
//         // int l, r; cin >> l >> r;
//         // cout << get_max(l, r) << '\n';
//         int A, B, C, D;
//         cin >> A >> B >> C >> D;
//         cout << minimum_jumps_sub7(A,B,C,D) << '\n';
//     }
// }

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 15944 KB Output is correct
2 Correct 34 ms 15948 KB Output is correct
3 Correct 270 ms 55832 KB Output is correct
4 Correct 1271 ms 66048 KB Output is correct
5 Correct 1044 ms 41144 KB Output is correct
6 Correct 1304 ms 65988 KB Output is correct
7 Correct 786 ms 50236 KB Output is correct
8 Correct 1491 ms 65976 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 15944 KB Output is correct
2 Correct 37 ms 15944 KB Output is correct
3 Correct 34 ms 15956 KB Output is correct
4 Correct 37 ms 15944 KB Output is correct
5 Correct 36 ms 15944 KB Output is correct
6 Incorrect 40 ms 15944 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 15944 KB Output is correct
2 Correct 37 ms 15944 KB Output is correct
3 Correct 34 ms 15956 KB Output is correct
4 Correct 37 ms 15944 KB Output is correct
5 Correct 36 ms 15944 KB Output is correct
6 Incorrect 40 ms 15944 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 15916 KB Output is correct
2 Correct 35 ms 15960 KB Output is correct
3 Correct 37 ms 15968 KB Output is correct
4 Correct 40 ms 15944 KB Output is correct
5 Correct 117 ms 55616 KB Output is correct
6 Correct 150 ms 65184 KB Output is correct
7 Correct 95 ms 41172 KB Output is correct
8 Correct 145 ms 65220 KB Output is correct
9 Correct 48 ms 23368 KB Output is correct
10 Correct 150 ms 65220 KB Output is correct
11 Correct 136 ms 66048 KB Output is correct
12 Correct 138 ms 65828 KB Output is correct
13 Incorrect 135 ms 65816 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 15956 KB Output is correct
2 Correct 36 ms 16064 KB Output is correct
3 Correct 35 ms 15944 KB Output is correct
4 Correct 346 ms 38640 KB Output is correct
5 Correct 854 ms 65216 KB Output is correct
6 Correct 686 ms 24192 KB Output is correct
7 Correct 1008 ms 65212 KB Output is correct
8 Correct 645 ms 32924 KB Output is correct
9 Correct 1146 ms 65340 KB Output is correct
10 Correct 1431 ms 66080 KB Output is correct
11 Correct 1177 ms 65988 KB Output is correct
12 Correct 1138 ms 65856 KB Output is correct
13 Correct 1126 ms 65216 KB Output is correct
14 Correct 1038 ms 65512 KB Output is correct
15 Correct 943 ms 65984 KB Output is correct
16 Correct 1170 ms 65988 KB Output is correct
17 Correct 37 ms 15944 KB Output is correct
18 Correct 33 ms 15948 KB Output is correct
19 Correct 39 ms 15968 KB Output is correct
20 Correct 38 ms 15904 KB Output is correct
21 Correct 39 ms 16012 KB Output is correct
22 Correct 37 ms 15944 KB Output is correct
23 Correct 39 ms 15944 KB Output is correct
24 Correct 40 ms 15948 KB Output is correct
25 Correct 34 ms 15916 KB Output is correct
26 Correct 38 ms 16272 KB Output is correct
27 Correct 62 ms 16448 KB Output is correct
28 Correct 58 ms 16380 KB Output is correct
29 Correct 49 ms 16412 KB Output is correct
30 Correct 58 ms 16456 KB Output is correct
31 Correct 57 ms 16456 KB Output is correct
32 Correct 39 ms 15960 KB Output is correct
33 Correct 103 ms 44648 KB Output is correct
34 Correct 149 ms 65220 KB Output is correct
35 Correct 150 ms 65932 KB Output is correct
36 Correct 149 ms 65224 KB Output is correct
37 Correct 176 ms 65508 KB Output is correct
38 Correct 141 ms 66076 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 15956 KB Output is correct
2 Correct 36 ms 16064 KB Output is correct
3 Correct 35 ms 15944 KB Output is correct
4 Correct 346 ms 38640 KB Output is correct
5 Correct 854 ms 65216 KB Output is correct
6 Correct 686 ms 24192 KB Output is correct
7 Correct 1008 ms 65212 KB Output is correct
8 Correct 645 ms 32924 KB Output is correct
9 Correct 1146 ms 65340 KB Output is correct
10 Correct 1431 ms 66080 KB Output is correct
11 Correct 1177 ms 65988 KB Output is correct
12 Correct 1138 ms 65856 KB Output is correct
13 Correct 1126 ms 65216 KB Output is correct
14 Correct 1038 ms 65512 KB Output is correct
15 Correct 943 ms 65984 KB Output is correct
16 Correct 1170 ms 65988 KB Output is correct
17 Correct 37 ms 15944 KB Output is correct
18 Correct 33 ms 15948 KB Output is correct
19 Correct 39 ms 15968 KB Output is correct
20 Correct 38 ms 15904 KB Output is correct
21 Correct 39 ms 16012 KB Output is correct
22 Correct 37 ms 15944 KB Output is correct
23 Correct 39 ms 15944 KB Output is correct
24 Correct 40 ms 15948 KB Output is correct
25 Correct 34 ms 15916 KB Output is correct
26 Correct 38 ms 16272 KB Output is correct
27 Correct 62 ms 16448 KB Output is correct
28 Correct 58 ms 16380 KB Output is correct
29 Correct 49 ms 16412 KB Output is correct
30 Correct 58 ms 16456 KB Output is correct
31 Correct 57 ms 16456 KB Output is correct
32 Correct 39 ms 15960 KB Output is correct
33 Correct 103 ms 44648 KB Output is correct
34 Correct 149 ms 65220 KB Output is correct
35 Correct 150 ms 65932 KB Output is correct
36 Correct 149 ms 65224 KB Output is correct
37 Correct 176 ms 65508 KB Output is correct
38 Correct 141 ms 66076 KB Output is correct
39 Correct 36 ms 15968 KB Output is correct
40 Correct 39 ms 15944 KB Output is correct
41 Correct 33 ms 15948 KB Output is correct
42 Correct 353 ms 38508 KB Output is correct
43 Correct 1176 ms 65216 KB Output is correct
44 Correct 753 ms 24008 KB Output is correct
45 Correct 1252 ms 65216 KB Output is correct
46 Correct 606 ms 32920 KB Output is correct
47 Correct 1139 ms 65200 KB Output is correct
48 Correct 1082 ms 66112 KB Output is correct
49 Correct 1349 ms 66136 KB Output is correct
50 Correct 1185 ms 65940 KB Output is correct
51 Correct 1035 ms 65176 KB Output is correct
52 Correct 1016 ms 65656 KB Output is correct
53 Correct 1149 ms 66148 KB Output is correct
54 Correct 1105 ms 66096 KB Output is correct
55 Correct 36 ms 15944 KB Output is correct
56 Correct 213 ms 65056 KB Output is correct
57 Correct 1099 ms 65324 KB Output is correct
58 Correct 523 ms 24512 KB Output is correct
59 Correct 1055 ms 65220 KB Output is correct
60 Correct 448 ms 33344 KB Output is correct
61 Correct 1105 ms 65196 KB Output is correct
62 Correct 1079 ms 66192 KB Output is correct
63 Correct 1269 ms 65856 KB Output is correct
64 Correct 1060 ms 65728 KB Output is correct
65 Correct 966 ms 65216 KB Output is correct
66 Correct 945 ms 65552 KB Output is correct
67 Correct 1222 ms 66044 KB Output is correct
68 Correct 1125 ms 66096 KB Output is correct
69 Correct 33 ms 15944 KB Output is correct
70 Correct 38 ms 15976 KB Output is correct
71 Correct 39 ms 16132 KB Output is correct
72 Correct 37 ms 15884 KB Output is correct
73 Correct 36 ms 16004 KB Output is correct
74 Correct 37 ms 15916 KB Output is correct
75 Correct 36 ms 16016 KB Output is correct
76 Correct 34 ms 15964 KB Output is correct
77 Correct 37 ms 15900 KB Output is correct
78 Correct 39 ms 15944 KB Output is correct
79 Correct 40 ms 15952 KB Output is correct
80 Correct 38 ms 15944 KB Output is correct
81 Correct 38 ms 16008 KB Output is correct
82 Correct 39 ms 16008 KB Output is correct
83 Correct 39 ms 16008 KB Output is correct
84 Correct 37 ms 15944 KB Output is correct
85 Correct 38 ms 15944 KB Output is correct
86 Correct 55 ms 16456 KB Output is correct
87 Correct 64 ms 16456 KB Output is correct
88 Correct 70 ms 16456 KB Output is correct
89 Correct 46 ms 16456 KB Output is correct
90 Correct 48 ms 16576 KB Output is correct
91 Correct 34 ms 15944 KB Output is correct
92 Correct 34 ms 16072 KB Output is correct
93 Correct 54 ms 16456 KB Output is correct
94 Correct 50 ms 16380 KB Output is correct
95 Correct 60 ms 16368 KB Output is correct
96 Correct 49 ms 16456 KB Output is correct
97 Correct 62 ms 16456 KB Output is correct
98 Correct 33 ms 15944 KB Output is correct
99 Correct 137 ms 65052 KB Output is correct
100 Correct 158 ms 65180 KB Output is correct
101 Correct 133 ms 65860 KB Output is correct
102 Correct 136 ms 65216 KB Output is correct
103 Correct 176 ms 65712 KB Output is correct
104 Correct 156 ms 65980 KB Output is correct
105 Correct 35 ms 15972 KB Output is correct
106 Correct 94 ms 44476 KB Output is correct
107 Correct 155 ms 65172 KB Output is correct
108 Correct 138 ms 65948 KB Output is correct
109 Correct 140 ms 65176 KB Output is correct
110 Correct 160 ms 65512 KB Output is correct
111 Correct 153 ms 66240 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 15944 KB Output is correct
2 Correct 34 ms 15948 KB Output is correct
3 Correct 270 ms 55832 KB Output is correct
4 Correct 1271 ms 66048 KB Output is correct
5 Correct 1044 ms 41144 KB Output is correct
6 Correct 1304 ms 65988 KB Output is correct
7 Correct 786 ms 50236 KB Output is correct
8 Correct 1491 ms 65976 KB Output is correct
9 Correct 33 ms 15944 KB Output is correct
10 Correct 37 ms 15944 KB Output is correct
11 Correct 34 ms 15956 KB Output is correct
12 Correct 37 ms 15944 KB Output is correct
13 Correct 36 ms 15944 KB Output is correct
14 Incorrect 40 ms 15944 KB Output isn't correct
15 Halted 0 ms 0 KB -