Submission #1357013

#	Time	Username	Problem	Language	Result	Execution time	Memory
1357013		camal1331	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	13 / 100	618 ms	18060 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] ;
    }
    vector<ll>pre(n+2,0);
    for(ll i=2;i<=n;i++){
        pre[i]=pre[i-1];
        if(a[i]>=a[i-1]){
            pre[i]++;
        }
    }
    if(a[n]>=a[n-1]){
        pre[n]=pre[n-1]+1;
    }
    while(q--){
        ll l ,r,k;
        cin>>l>>r>>k;
        if(r-l==pre[r]-pre[l]){
            cout<<1<<endl;
        }   
        else{
            cout<<0<<endl;
        }
    }
}
signed main(){
    NEGGERS
    ll tt=1;
    //cin>>tt;
    while(tt--){
        solve();
    }
}

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