Submission #1357026

#TimeUsernameProblemLanguageResultExecution timeMemory
1357026veyis_116Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
13 / 100
622 ms25864 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
int main(){
      ios::sync_with_stdio(0);
      cin.tie(0);
      cout.tie(0);
        ll n,m; cin>>n>>m;
        ll a[n+1]; for(ll i=1;i<=n;i++) cin>>a[i];
        ll pre[n+1]; pre[0]=0;
        ll b[n+1];
        for(ll i=1;i<n;i++){
            if(a[i]>a[i+1]) b[i]=-1;
            else b[i]=0;
        }
        ll sum=0;
        for(ll i=1;i<n;i++){
           sum+=b[i] ;
           pre[i]=sum;
        }
        while(m--){
            ll l,r,v; cin>>l>>r>>v;
            if(pre[r-1]-pre[l-1]<0) cout<<0<<endl;
            else cout<<1<<endl;
        }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...