제출 #1311590

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

sortbooks

#include <iostream>
#include <cstdio>
#include <vector>
#include <array>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <limits>
#include <tuple>
#include <stack>
#include <bitset>
#include <cstring>
#include <sstream>
#include <functional>
#include <random>
#include <memory>
using namespace std;

using ll = long long;
const ll mN = LLONG_MIN;

int n, q;
vector<ll> a;

struct mst {
    int n;
    vector<int> st, len;
    vector<int> svi;
    vector<ll> val;
    vector<int> comp;

    mst(const vector<ll>& a) {
        n = a.size();
        val = a;

        sort(val.begin(), val.end());
        val.erase(unique(val.begin(), val.end()), val.end());

        comp.resize(n);
        for (int i = 0; i < n; i++) {
            comp[i] = lower_bound(val.begin(), val.end(), a[i]) - val.begin();
        }

        st.assign(4 * n, 0);
        len.assign(4 * n, 0);
        svi.reserve(21 * n);

        build(1, 0, n - 1);
    }

    void build(int u, int l, int r) {
        if (l == r) {
            st[u] = (int)svi.size();
            len[u] = 1;
            svi.push_back(comp[l]);
            return;
        }

        int mid = (l + r) / 2;
        build(2 * u, l, mid);
        build(2 * u + 1, mid + 1, r);

        int ls = st[u * 2], ln = len[u * 2];
        int rs = st[u * 2 + 1], rn = len[u * 2 + 1];

        st[u] = (int)svi.size();
        len[u] = ln + rn;
        svi.resize(svi.size() + len[u]);

        int i = 0, j = 0, k = 0;
        while (i < ln && j < rn) {
            if (svi[ls + i] <= svi[rs + j]) {
                svi[st[u] + k++] = svi[ls + i++];
            }
            else {
                svi[st[u] + k++] = svi[rs + j++];
            }
        }
        while (i < ln){
            svi[st[u] + k++] = svi[ls + i++];
        }   
        while (j < rn) {
            svi[st[u] + k++] = svi[rs + j++];
        }
    }

    inline int prn(int u, int x) const {
        int s = st[u], m = len[u];
        auto it = lower_bound(svi.begin() + s, svi.begin() + s + m, x);
        if (it == svi.begin() + s) {
            return -1;
        }
        return *(it - 1);
    }
};

mst* MST = nullptr;

struct SS {
    ll k;
    int mx;
};

vector<SS> seg;

inline ll sid(int i, int j) {
    return MST->val[i] + MST->val[j];
}

void build(int u, int l, int r) {
    if (l == r) {
        seg[u].mx = MST->comp[l];
        seg[u].k = 0;
        return;
    }
    int mid = (l + r) / 2;
    build(2 * u, l, mid);
    build(2 * u + 1, mid + 1, r);

    seg[u].mx = max(seg[2 * u].mx, seg[2 * u + 1].mx);

    ll c = mN;
    int pred = MST->prn(2 * u + 1, seg[2 * u].mx); 
    if (pred != -1) {
        c = sid(seg[2 * u].mx, pred);
    }

    seg[u].k = max({ seg[2 * u].k, seg[2 * u + 1].k, c });
}


void col(int u, int l, int r, int ql, int qr, vector<int>& nd) {
    if (qr < l || r < ql) {
        return;
    }
    if (ql <= l && r <= qr) {
        nd.push_back(u);
        return;
    }
    int mid = (l + r) / 2;
    col(2 * u, l, mid, ql, qr, nd);
    col(2 * u + 1, mid + 1, r, ql, qr, nd);
}

ll qn(int l, int r) {
    static vector<int> nd;
    nd.clear();
    nd.reserve(64);
    col(1, 0, n - 1, l, r, nd);

    ll kol = 0;
    int mx = -1;

    for (auto& u : nd) {
        kol = max(kol, seg[u].k);
        if (mx != -1) {
            int pred = MST->prn(u, mx);
            if (pred != -1) {
                kol = max(kol, sid(mx, pred));
            }
        }
        mx = max(mx, seg[u].mx);
    }
    return kol;
}

void solve() {
    cin >> n >> q;
    a.resize(n);
    for (int i = 0; i < n; ++i) cin >> a[i];

    mst mmm(a);
    MST = &mmm;

    seg.assign(4 * n, { 0, 0 });
    build(1, 0, n - 1);

    string out;
    out.reserve((size_t)q * 2);

    while (q--) {
        int l, r;
        ll k;
        cin >> l >> r >> k;
        --l, --r;

        ll kol = qn(l, r);
        if (k >= kol) {
            cout << "1\n";
        }
        else {
            cout << "0\n";
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

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