Submission #1357008

#	Time	Username	Problem	Language	Result	Execution time	Memory
1357008		camal1331	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	34 / 100	3093 ms	10144 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define NEGGERS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void solve(){
    ll n ;
    cin>>n;
    ll q;
    cin>>q ;
    vector<ll>a(n+1) ;
    for(ll i=1;i<=n;i ++) {
        cin>>a[i];
    }
    while(q --){
        bool ok=1;
        ll l,r,k;
        cin>>l>>r>>k;
        ll maks=0;
        for(ll i=l;i<=r;i++){
            if(a[i]<maks){
                if(maks+a[i]>k){
                    ok=0;
                    break;
                }
            }
            if(a[i]>maks){
                maks=a[i];
            }
        }
        if(ok) cout<<1<<endl;
        else cout<<0<<endl;
    }
}
signed main(){
    NEGGERS
    ll tt=1;
    //cin>>tt;
    while(tt--){
        solve();
    }
}

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