Submission #330705

#	Time	Username	Problem	Language	Result	Execution time	Memory
330705		nvmdava	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	64 / 100	3042 ms	238104 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 4000005;
const ll MOD = 1'000'000'007;
const int INF = 0x3f3f3f3f;

int w[N];
vector<int> seg[N];
int ans[N];

int calc(int x, int i){
    if(seg[i][0] >= x) return 0;
    if(seg[i].back() < x) return x + seg[i].back();
    auto it = lower_bound(seg[i].begin(), seg[i].end(), x);
    return x + *(--it);
}

void build(int id, int l, int r){
    if(l == r){
        seg[id].push_back(w[l]);
        return;
    }
    int m = (l + r) >> 1;
    int i1 = 0, i2 = 0, id1 = id << 1, id2 = id << 1 | 1, s1, s2;

    build(id1, l, m);
    build(id2, m + 1, r);
    s1 = seg[id1].size(); s2 = seg[id2].size();

    while(i1 != s1 && i2 != s2)
        seg[id].push_back(seg[id1][i1] < seg[id2][i2] ? seg[id1][i1++] : seg[id2][i2++]);
    while(i1 != s1)
        seg[id].push_back(seg[id1][i1++]);
    while(i2 != s2)
        seg[id].push_back(seg[id2][i2++]);
    
    int t = calc(seg[id1].back(), id2);

    ans[id] = max({ans[id1], ans[id2], t});
}
int lm;
bool query(int id, int l, int r, int L, int R, int k){
    if(r < L || l > R)
        return 1;
    if(L <= l && r <= R){
        int res = max(ans[id], lm * 2 <= k ? 0 : calc(lm, id));
        lm = max(lm, seg[id].back());
        return res <= k;
    }
    int m = (l + r) >> 1;
    if(query(id << 1, l, m, L, R, k) == 0)
        return 0;
    if(query(id << 1 | 1, m + 1, r, L, R, k) == 0)
        return 0;
    return 1;
}

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

    int n, m;
    cin>>n>>m;

    for(int i = 1; i <= n; ++i)
        cin>>w[i];
    build(1, 1, n);

    while(m--){
        int l, r, k;
        cin>>l>>r>>k;
        lm = 0;
        cout<<query(1, 1, n, l, r, k)<<'\n';
    }
}

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