Submission #1335858

#	Time	Username	Problem	Language	Result	Execution time	Memory
1335858		yc11	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	17 / 100	3094 ms	6328 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;
int n,m;
signed main(){
    cin>>n>>m;
    vector<int> n1;
    n1.resize(n);
    for (int i = 0;i<n;i++) cin>>n1[i];
    for (int i = 0;i<m;i++){
        bool hi = false;
        int a,b,k;
        cin>>a>>b>>k;
        int m = -1;
        for (int j = a-1;j<b;j++){
            m = max(m,n1[j]);
            if (m>n1[j] and m+n1[j]>k){
                cout<<0<<"\n";
                hi = true;
                break;
            }
        }
        if (!hi)cout<<1<<"\n";
    }


    return 0;
    }

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