Submission #1356995

#	Time	Username	Problem	Language	Result	Execution time	Memory
1356995		ElayV13	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	3095 ms	28880 KiB

sortbooks

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

#define int long long 
const int INF=1e18;
const int N=1000001;

int n,q;
int a[N];

void solve(){
    cin>>n>>q;
    for(int i=1;i<=n;i++) cin>>a[i];
    while(q--){
        int l,r,x;
        cin>>l>>r>>x;
        vector<int>a1,a2;
        for(int i=l;i<=r;i++){
            a1.push_back(a[i]);
            a2.push_back(a[i]);
        }
        sort(a2.begin(),a2.end());
        int mx=-INF;
        for(int i=0;i<a1.size();i++){
            if(a1[i]!=a2[i]){
                mx=max(mx,a1[i]);
            }
        }
        cout<<((mx+a2[0]<=x))<<'\n';
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int 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