Submission #1236008

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236008		ddat	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3092 ms	2048 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
int n,m;
int a[200009];
int amax[200009];
int main(){
    ios_base::sync_with_stdio(0);
	cin.tie(NULL);
    cin>>n>>m;
    for(int i=1; i<=n; i++){
        cin>>a[i];
    }
    while(m--){
        int l,r,k;
        cin>>l>>r>>k;
        for(int i=l-1; i<=r; i++){
            amax[i]=0;
        }
        for(int i=l; i<=r; i++){
            amax[i]=max(a[i],amax[i-1]);
        }
        int ok=1;
        for(int i=l+1; i<=r; i++){
            if(amax[i-1]>a[i]&&a[i]+amax[i-1]>k){
                ok=0;
                break;
            }
        }
        cout<<ok<<'\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