Submission #651198

#	Time	Username	Problem	Language	Result	Execution time	Memory
651198		alexccc	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3055 ms	4656 KiB

sortbooks

#include <bits/stdc++.h> 

using namespace std;

int main(){

    int n, m;
    cin >> n >> m;
    vector<int> w(n + 1);
    for(int i = 1; i <= n; i ++) cin >> w[i];
    int l, r, k;
    for(int i = 0; i < m; i ++){
        cin >> l >> r >> k;
        int mx = w[l];
        int check = 1;
        for(int j = l; j <= r; j ++){
            if(w[i] < mx && mx + w[i] > k){
                check = 0;
                break;
            }
            mx = max(mx,w[i]);
        }
        cout << check << '\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