제출 #1156308

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1156308		Ghulam_Junaid	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	100 / 100	755 ms	67132 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 100;
int n, m, a[N], tol[N], ans[N], seg[4 * N];
vector<pair<int, pair<int, int>>> query[N];

void upd(int p, int x, int v = 1, int s = 0, int e = n + 1){
    if (e - s == 1){
        seg[v] = max(seg[v], x);
        return ;
    }

    int mid = (s + e) / 2, lc = 2 * v, rc = lc + 1;

    if (p < mid) upd(p, x, lc, s, mid);
    else upd(p, x, rc, mid, e);

    seg[v] = max(seg[lc], seg[rc]);
}

int get(int l, int v = 1, int s = 0, int e = n + 1){
    if (e <= l) return 0;
    if (l <= s) return seg[v];

    int mid = (s + e) / 2, lc = 2 * v, rc = lc + 1;

    return max(get(l, lc, s, mid), get(l, rc, mid, e));
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m;
    for (int i = 1; i <= n; i ++)
        cin >> a[i];
    for (int i = 0; i < m; i ++){
        int l, r, k;
        cin >> l >> r >> k;
        query[r].push_back({i, {l, k}});
    }

    stack<int> st;
    for (int i = 1; i <= n; i ++){
        while (!st.empty() and a[st.top()] <= a[i])
            st.pop();
        if (!st.empty()) tol[i] = st.top();
        st.push(i);
    }

    for (int r = 1; r <= n; r ++){
        upd(tol[r], a[r] + a[tol[r]]);
        for (auto [id, P] : query[r]){
            auto [l, k] = P;
            int mx = get(l);
            if (mx <= k) ans[id] = 1;
        }
    }

    for (int i = 0; i < m; i ++)
        cout << ans[i] << '\n';
}

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 13 / 13
• Subtask 4: 17 / 17
• Subtask 5: 30 / 30
• Subtask 6: 23 / 23