Submission #1357006

#	Time	Username	Problem	Language	Result	Execution time	Memory
1357006		camal1331	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	1194 ms	64936 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>idx;
    multiset<ll>mst;
    for(ll i=1;i<=n;i++){
        mst.insert(a[i]);
        if(*--mst.end()!=a[i]){
            idx.push_back(i);
        }
    }
    sort(idx.begin(),idx.end());
    while(q--){
        ll l ,r,k;
        cin>>l>>r>>k;
        ll d=upper_bound(idx.begin(),idx.end(),l)-idx.begin();
        if(idx[d]<=r){
            cout<<0<<endl;
        }
        else{
            cout<<1<<endl;
        }
    }
}
signed main(){
    NEGGERS
    ll tt=1;
    //cin>>tt;
    while(tt--){
        solve();
    }
}

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