제출 #1219349

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1219349		M_SH_O	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	544 ms	327680 KiB

sortbooks

#include <bits/stdc++.h>
//#include "grader.h"
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
//#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define all(a) a.begin(), a.end()
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000000
#define ordered_set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(1488);
ll randll(ll l, ll r){
    return uniform_int_distribution<ll>(l, r)(rng);
}

/*vvll s1;
vll p;

ll find(ll v) {
    if (p[v] == v) return v;
    return p[v] = find(p[v]);
}

vll unite(ll a, ll b) {
    a = find(a);
    b = find(b);

    if (a == b) return {};
    if (s1[a].size() < s1[b].size()) {
        p[a] = b;
        for (auto i : s1[a]) {
            s1[b].pb(i);

        }
        return s1[a];
    }
    else {
        p[b] = a;
        for (auto i : s1[b]) {
            s1[a].pb(i);

        }
        return s1[b];
    }
}*/

vll tree1, d, tree;
vvll tree_a;

void push(ll v, ll tl, ll tr) {
    if (tl == tr) return;
    tree1[v*2] += d[v];
    tree1[v*2+1] += d[v];
    d[v*2] += d[v];
    d[v*2+1] += d[v];
    d[v] = 0;
    tree1[v] = tree1[v*2]+tree1[v*2+1];
}

void bt(ll v, ll tl, ll tr, vll& a) {
    if (tl == tr) {
        tree1[v] = 0;
        tree[v] = a[tl];
        tree_a[v].pb(a[tl]);
        return;
    }

    ll tm = (tl+tr)/2;
    bt(v*2, tl, tm, a);
    bt(v*2+1, tm+1, tr, a);

    tree[v] = max(tree[v*2], tree[v*2+1]);
    ll l = 0, l1 = 0;
    for (int i = 0; i < tree_a[v*2].size()+tree_a[v*2+1].size(); i ++) {
        if (l1 == tree_a[v*2+1].size() || (l < tree_a[v*2].size() && tree_a[v*2][l] <= tree_a[v*2+1][l1])) {
            tree_a[v].pb(tree_a[v*2][l ++]);
        }
        else tree_a[v].pb(tree_a[v*2+1][l1 ++]);
    }
    l = -1;
    ll r = tree_a[v*2+1].size();
    while (r-l > 1) {
        ll x = (l+r)/2;
        if (tree_a[v*2+1][x] < tree[v*2]) l = x;
        else r = x;
    }
    tree1[v] = max(tree1[v*2], tree1[v*2+1]);
    if (l != -1) tree1[v] = max(tree1[v], tree_a[v*2+1][l]+tree[v*2]);
}

pll get(ll l, ll r, ll mx, ll v, ll tl, ll tr) {
    if (l <= tl && tr <= r) {
        ll l1 = -1;
        ll r1 = tree_a[v].size();
        while (r-l > 1) {
            ll x = (l+r)/2;
            if (tree_a[v][x] < mx) l = x;
            else r = x;
        }
        ll k = tree1[v];
        if (l != -1) k = max(k, mx+tree_a[v][l]);
        return {tree[v], k};
    }
    if (tl > r || tr < l) return {-INF, -INF};

    ll tm = (tl+tr)/2;
    //push(v, tl, tr);
    pll p = get(l, r, mx, v*2, tl, tm);
    mx = max(mx, p.fr);
    pll p1 = get(l, r, mx, v*2+1, tm+1, tr);
    mx = max(mx, p1.fr);
    return {mx, max(p.se, p1.se)};
}
/*

void update(ll l, ll r, ll val, ll v, ll tl, ll tr) {
    if (l <= tl && tr <= r) {
        tree1[v] += val;
        d[v] += val;
        push(v, tl, tr);
        return;
    }
    if (tl > r || tr < l) return;

    ll tm = (tl+tr)/2;
    push(v, tl, tr);

    update(l, r, val, v*2, tl, tm);
    update(l, r, val, v*2+1, tm+1, tr);

    tree1[v] = tree1[v*2]+tree1[v*2+1];
}*/

int main() {
    ll n, q;
    cin >> n >> q;
    tree.resize(n*4+7);
    tree1.resize(n*4+7);
    tree_a.resize(n*4+7);

    vll a(n);
    for (int i =0 ; i < n; i ++) {
        cin >> a[i];
    }

    bt(1, 0, n-1, a);

    while (q --) {
        ll l, r, x;
        cin >> l >> r >> x;
        l --;
        r --;
        //cout << v[r] << ' ' << p.fr << ' ' << p1.se << endl;
        pll p = get(l, r, -INF, 1, 0, n-1);
        if (p.se <= x) cout << 1 << endl;
        else cout << 0 << endl;
    }
}

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