Submission #490513

#	Time	Username	Problem	Language	Result	Execution time	Memory
490513		fuad27	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	30 / 100	3078 ms	14616 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 10;
int main () {
    int n, m;
    cin >> n >> m;
    long long arr[n];
    for(int i = 0;i<n;i++)cin>>arr[i];
    int prefix[n+1] = {0};
    long long MIN = arr[0];
    for(int i = 2;i<=n;i++){
        MIN = min(MIN, arr[i-1]);
        prefix[i] = (prefix[i-1]+(arr[i-1] >= arr[i-2]));
    }
    while(m--) {
        int l, r, m;
        cin >> l >> r >> m;
        long long MAX = arr[l-1],ans = 0; 
        if(m <= MIN) {
            cout << (prefix[r]-prefix[l] == r-l) << endl;
        }
        else {
        for(int i = l;i<r;i++) {
            MAX = max(arr[i],MAX);
            if(arr[i] < MAX)
            ans = max(ans, MAX+arr[i]);
        }
        cout << (ans <= m) << endl;}
    }
}

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