제출 #1310247

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1310247		fauntleroy	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	64 / 100	3099 ms	192744 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;        

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

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

        vector<int> comp(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, comp);
    }

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

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

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

        st[u] = 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++];
        }
    }

    ll query(int l, int r, ll k) {
        int x = lower_bound(val.begin(), val.end(), k) - val.begin();
        int idx = -1;
        q(1, 0, n - 1, l, r, x, idx);
        if (idx == -1) {
            return mN;
        }
        return val[idx];
    }

    void q(int u, int l, int r, int ql, int qr, int x, int& idx) {
        if (ql > r || qr < l) {
            return;
        }
        if (ql <= l && r <= qr) {
            int s = st[u], m = len[u];
            auto it = lower_bound(svi.begin() + s, svi.begin() + s + m, x);
            if (it != svi.begin() + s) {
                idx = max(idx, *(it - 1));
            }
            return;
        }
        int mid = (l + r) / 2;
        q(u * 2, l, mid, ql, qr, x, idx);
        q(u * 2 + 1, mid + 1, r, ql, qr, x, idx);
    }
};

mst* MST = nullptr;

struct Node {
    ll k, mx;
    int l, r;
    bool f;
};

struct SS {
    ll k, mx;
};

vector<SS> seg;

Node merge(const Node& a, const Node& b) {
    if (a.f) {
        return b;
    }
    if (b.f) {
        return a;
    }

    Node r;
    r.f = false;
    r.l = a.l;
    r.r = b.r;
    r.mx = max(a.mx, b.mx);

    ll c = mN;

    ll y = MST->query(b.l, b.r, a.mx);
    if (y != mN) {
        c = a.mx + y;
    }

    r.k = max({ a.k, b.k, c });
    return r;
}

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

    Node A{ seg[2 * u].k, seg[2 * u].mx, l, mid, false };
    Node B{ seg[2 * u + 1].k, seg[2 * u + 1].mx, mid + 1, r, false };
    Node C = merge(A, B);

    seg[u].k = C.k;
    seg[u].mx = C.mx;
}

Node query(int u, int l, int r, int ql, int qr) {
    if (r < ql || l > qr) {
        return { mN, mN, 0, -1, true };
    }
    if (ql <= l && r <= qr) {
        return { seg[u].k, seg[u].mx, l, r, false };
    }
    int mid = (l + r) >> 1;
    Node L = query(2 * u, l, mid, ql, qr);
    Node R = query(2 * u + 1, mid + 1, r, ql, qr);
    return merge(L, R);
}

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);

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

        Node qr = query(1, 0, n - 1, l, r);

        if (qr.k == mN || k < qr.k) {
            cout << "0\n";
        }
        else {
            cout << "1\n";
        }
    }
}

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

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