Submission #1131048

#	Time	Username	Problem	Language	Result	Execution time	Memory
1131048		vladilius	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	3099 ms	174732 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
#define arr3 array<int, 3>

struct ST{
    vector<int> a;
    int n;
    ST(int ns){
        n = ns;
        a.resize(n + 1);
    }
    void upd(int p, int x){
        a[p] = x;
    }
    int get(int l, int r){
        int out = 0;
        for (int i = l; i <= r; i++){
            out = max(out, a[i]);
        }
        return out;
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, q; cin>>n>>q;
    vector<int> a(n + 2);
    for (int i = 1; i <= n; i++){
        cin>>a[i];
    }
    
    vector<int> log(n + 1);
    for (int i = 2; i <= n; i++) log[i] = log[i / 2] + 1;
    
    const int lg = log[n];
    vector<vector<int>> sp(n + 1, vector<int>(lg + 1));
    for (int i = 1; i <= n; i++) sp[i][0] = a[i];
    for (int j = 1; j <= lg; j++){
        for (int i = 1; i + (1 << j) <= n + 1; i++){
            sp[i][j] = max(sp[i][j - 1], sp[i + (1 << (j - 1))][j - 1]);
        }
    }
    
    auto get = [&](int l, int r){
        if (l > r) return 0;
        int k = log[r - l + 1];
        return max(sp[l][k], sp[r - (1 << k) + 1][k]);
    };
    
    vector<arr3> end[n + 1];
    for (int i = 1; i <= q; i++){
        int l, r, k; cin>>l>>r>>k;
        end[l].pb({r, k, i});
    }
    
    deque<int> d1, d2;
    a[n + 1] = 1e9 + 1;
    d1.pb(n + 1);
    d2.pb(a[n + 1]);
    ST T(n);
    deque<int> :: iterator it;
    vector<bool> out(q + 1);
    for (int i = n; i > 0; i--){
        while (!d1.empty() && a[d1.front()] <= a[i]){
            T.upd(d1.front(), 0);
            d1.pop_front();
            d2.pop_front();
        }
        int j = d1.front();
        d1.push_front(i);
        d2.push_front(get(i + 1, j - 1));
        if (d2.front()) T.upd(i, a[i] + d2.front());
        for (auto [r, k, ii]: end[i]){
            it = upper_bound(d1.begin(), d1.end(), r);
            it--;
            j = *it;
            int v = T.get(1, j - 1);
            if (j < r){
                v = max(v, a[j] + get(j + 1, r));
            }
            out[ii] = (v <= k);
        }
    }
    
    for (int i = 1; i <= q; i++) cout<<out[i]<<"\n";
}

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