Submission #330717

#	Time	Username	Problem	Language	Result	Execution time	Memory
330717		vitkishloh228	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3087 ms	4332 KiB

sortbooks

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
    int n, q;
    cin >> n >> q;
    vector<int> a(n);
    for (int& i : a) cin >> i;
    while (q--) {
        int l, r, c;
        cin >> l >> r >> c;
        --l, --r;
        int ans = 0;
        for (int i = l; i <= r; ++i) {
            for (int j = i + 1; j <= r; ++j) {
                if (a[i] > a[j]) {
                    ans = max(ans, a[i] + a[j]);
                }
            }
        }
        if (ans <= c) {
            cout << 1 << endl;
        }
        else cout << 0 << endl;
    }
}

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