Submission #180555

#	Time	Username	Problem	Language	Result	Execution time	Memory
180555		43V3R	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	17 / 100	3100 ms	5552 KiB

sortbooks

#include <iostream>
#define sum(a, b) ( (a) + (b) )

using namespace std;

int n, m, a[2000006], t[2000006];

void build(int v, int l, int r){
    if(l == r){
        t[v] = a[l];
        return;
    }
}

int main()
{
    cin >> n >> m;
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    for(int i = 0; i < m; i++){
        int l, r, s, mx, q = 0;
        cin >> l >> r >> s;
        --l; --r;
        mx = a[l];
        for(int j = l; j <= r; j++){
            if(a[j] >= mx){
                mx = a[j];
            }
            else {
                if(a[j] + mx > s){
                    cout << 0;
                    q = 1;
                    break;
                }
            }
        }
        if(q == 0) cout << 1;
        cout << endl;
    }
    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