Submission #1336065

#	Time	Username	Problem	Language	Result	Execution time	Memory
1336065		justin271828	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	3096 ms	33548 KiB

sortbooks

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

int main() {
    int N, M;
    cin >> N >> M;
    int w[N];
    for (int i = 0; i < N; i++) cin >> w[i];
    while (M-- > 0) {
        int l, r, k;
        cin >> l >> r >> k;
        l--;
        r--;
        set<int> seta;
        int ans = 0;
        for (int i = l; i <= r; i++) {
            set<int>::iterator it = seta.upper_bound(w[i]);
            if (it != seta.end()) ans = max(ans, w[i]+*it);
            seta.insert(w[i]);
        }
        cout << (ans <= 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