제출 #416398

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
416398		valerikk	밀림 점프 (APIO21_jumps)	C++17	27 / 100	1662 ms	80312 KiB

jumps

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;

const int N = 2e5 + 7;
const int L = 19;
const int INF = 1e9;

int n;
int h[N];
pair<int, int> t[4 * N];

void tree_build(int v, int l, int r) {
    if (r - l == 1) {
        t[v] = {h[l], l};
    } else {
        int mid = (l + r) / 2;
        tree_build(2 * v, l, mid);
        tree_build(2 * v + 1, mid, r);
        t[v] = max(t[2 * v], t[2 * v + 1]);
    }
}

pair<int, int> get_max(int v, int l, int r, int a, int b) {
    if (l >= b || r <= a) return {-INF, -INF};
    if (l >= a && r <= b) return t[v];
    int mid = (l + r) / 2;
    return max(get_max(2 * v, l, mid, a, b), get_max(2 * v + 1, mid, r, a, b));
}

int find_first(int v, int l, int r, int a, int b, int val) {
    if (l >= b || r <= a || t[v].first <= val) return -1;
    if (l >= a && r <= b) return l;
    int mid = (l + r) / 2;
    int res = find_first(2 * v + 1, mid, r, a, b, val);
    if (res == -1) res = find_first(2 * v, l, mid, a, b, val);
    return res;
}

vector<vector<int>> build(vector<int> arr) {
    vector<vector<int>> go(L, vector<int>(n));
    for (int i = 0; i < n; ++i) go[0][i] = arr[i];
    for (int i = 1; i < L; ++i) {
        for (int j = 0; j < n; ++j) go[i][j] = go[i - 1][go[i - 1][j]];
    }
    return go;
}

vector<int> l, r, best;
vector<vector<int>> r2, best2;

void init(int N, vector<int> H) {
    n = N + 2;
    h[0] = n - 2;
    h[n - 1] = n - 1;
    for (int i = 0; i < N; ++i) h[i + 1] = H[i] - 1;
    l.resize(n);
    r.resize(n);
    best.resize(n);
    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();
        }
        st.push_back(i);
    }
    for (auto i : st) r[i] = n - 1;
    st.clear();
    for (int i = n - 1; i >= 0; --i) {
        while (!st.empty() && h[st.back()] < h[i]) {
            l[st.back()] = i;
            st.pop_back();
        }
        st.push_back(i);
    }
    for (auto i : st) l[i] = 0;
    st.clear();
    for (int i = 0; i < n; ++i) best[i] = h[l[i]] > h[r[i]] ? l[i] : r[i];
    r2 = build(r);
    best2 = build(best);
    tree_build(1, 0, n);
}

int minimum_jumps(int A, int B, int C, int D) {
    ++A, ++B, ++C, ++D;
    int mx = get_max(1, 0, n, C, D + 1).first;
    int mx2 = get_max(1, 0, n, B + 1, C).first;
    //cout << A << " " << B << " " << C << " " << D << " " << mx << " " << mx2 << " " << h[B] << endl;
    if (h[B] > mx || mx2 > mx) return -1;
    int min_pos = find_first(1, 0, n, 0, B + 1, mx);
    A = max(A, min_pos + 1);
    int st = get_max(1, 0, n, A, B + 1).second;
    int id = st, res = 0;
    for (int i = L - 1; i >= 0; --i) {
        if (h[best2[i][id]] < mx2) {
            id = best2[i][id];
            res += (1 << i);
        }
    }
    if (h[id] < mx2 && h[best[id]] < mx) {
        id = best[id];
        ++res;
    }
    for (int i = L - 1; i >= 0; --i) {
        if (h[r2[i][id]] < mx2) {
            id = r2[i][id];
            res += (1 << i);
        }
    }
    if (h[id] < mx2 && h[r[id]] < mx) {
        id = r[id];
        ++res;
    }
    id = r[id];
    ++res;
    assert(id >= C && id <= D);
    return res;
}

#ifdef LOCAL
int main() {
    freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, Q;
    cin >> N >> Q;
    vector<int> H(N);
    for (int i = 0; i < N; ++i) cin >> H[i];
    init(N, H);
    while (Q--) {
        int A, B, C, D;
        cin >> A >> B >> C >> D;
        cout << minimum_jumps(A, B, C, D) << endl;
    }
    return 0;
}
#endif

• Subtask 1: 4 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 23 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19