Submission #987377

#	Time	Username	Problem	Language	Result	Execution time	Memory
987377		steveonalex	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	100 / 100	1936 ms	125320 KiB

sortbooks

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 1e6 + 69;
const int INF = 1e9 + 69;
int a[N];
vector<array<int, 3>> query[N];
int ans[N];

struct SegmentTree{
    int n;
    vector<int> a;
    vector<int> lazy;

    SegmentTree(int _n){
        n = _n;
        a.resize(n * 4); lazy.resize(n * 4);
    }

    void down(int id){
        for(int i = id * 2; i <= id * 2 + 1; ++i) {
            lazy[i] += lazy[id];
            a[i] += lazy[id];
        }
        lazy[id] = 0;
    }

    void update(int u, int v, int val, int l, int r, int id){
        if (u <= l && r <= v){
            a[id] += val;
            lazy[id] += val;
            return;
        }
        down(id);
        int mid = (l + r) >> 1;
        if (u <= mid) update(u, v, val, l, mid, id * 2);
        if (v > mid) update(u, v, val, mid + 1, r, id * 2 + 1);
        a[id] = max(a[id * 2], a[id * 2 + 1]);
    }

    void update(int u, int v, int val){if (u <= v) update(u, v, val, 1, n, 1);}

    int get(int u, int v, int l, int r, int id){
        if (u <= l && r <= v) return a[id];
        down(id);
        int mid = (l + r) >> 1;
        int ans = 0;
        if (u <= mid) maximize(ans, get(u, v, l, mid, id * 2));
        if (v > mid) maximize(ans, get(u, v, mid + 1, r, id * 2 + 1));
        return ans;
    }

    int get(int u, int v){return get(u, v, 1, n, 1);}
};

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

    int n, m; cin >> n >> m;
    for(int i = 1; i<=n; ++i) cin >> a[i];
    for(int i =0; i<m; ++i){
        int l, r, k; cin >> l >> r >> k;
        query[l].push_back({{r, k, i}});
    }

    a[n+1] = INF;

    deque<int> st; st.push_back(n+1);
    SegmentTree segg(n);
    for(int i = n; i>=1; --i){
        while(a[st.back()] < a[i]) {
            int j = st.back();
            st.pop_back();
            int k = st.back();
            segg.update(j, j, a[j]);
            segg.update(j + 1, k-1, -a[j]);
        }
        int j = st.back();
        st.push_back(i);
        segg.update(i + 1, j - 1, a[i]);

        for(auto j: query[i]){
            ans[j[2]] = (segg.get(i, j[0]) <= j[1]);
        }
    }


    for(int i = 0; i<m; ++i){
        cout << ans[i] << "\n";
    }


    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