Submission #1058434

#	Time	Username	Problem	Language	Result	Execution time	Memory
1058434		trucmai	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3067 ms	8304 KiB

sortbooks

#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 6;
int n,q; long long a[N];
signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>q;
    for(int i = 1;i <= n;++i) cin>>a[i];
    while(q--){
        int l,r,k; cin>>l>>r>>k;
        long long temp = 0,temp2 = a[l];
        for (int i = l + 1; i <= r; i++){
            if (a[i] >= temp2) temp2 = a[i];
            else temp = max(temp, temp2 + a[i]);
        }
        cout<<(temp <= k ? 1 : 0)<<"\n";
    }       
}

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