Submission #991572

#	Time	Username	Problem	Language	Result	Execution time	Memory
991572		Mardonbekhazratov	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	2097 ms	31752 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;

void solve(){
    int n,m;
    cin>>n>>m;
    vector<int>a(n),dp(n);
    dp[0]=0;
    for(int i=0;i<n;i++){
        cin>>a[i];
        if(i>0){
            dp[i]=dp[i-1]+(a[i]<a[i-1]);
        }
    }
    while(m--){
        int l,r,k;
        cin>>l>>r>>k;
        // --l;
        // int mx=0;
        // bool ans=true;
        // for(int i=l;i<r;i++){
        //     mx=max(a[i],mx);
        //     if(mx>a[i] && mx+a[i]>k) ans=false;
        // }
        cout<<(dp[r-1]-dp[l-1]>0)<<'\n';
    }
}

signed main(){
    int t=1;
    // cin>>t;
    while(t--){
        solve();
        cout<<'\n';
    }
    return 0;
}

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