Submission #598925

#	Time	Username	Problem	Language	Result	Execution time	Memory
598925		Jomnoi	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	3061 ms	40756 KiB

sortbooks

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

const int MAX_N = 1e6 + 5;

int w[MAX_N];

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int N, M;
    cin >> N >> M;

    for(int i = 1; i <= N; i++) {
        cin >> w[i];
    }

    while(M--) {
        int l, r, k;
        cin >> l >> r >> k;

        multiset <int> s;
        for(int i = l; i <= r; i++) {
            s.insert(w[i]);
        }

        int ma = 0;
        for(int i = l; i < r; i++) {
            s.erase(s.lower_bound(w[i]));
            ma = max(ma, w[i] + *prev(s.lower_bound(w[i])));
        }

        cout << (ma <= k) << '\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