Submission #1266940

#TimeUsernameProblemLanguageResultExecution timeMemory
1266940GoBananas69Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
0 / 100
3094 ms4168 KiB
#include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, q;
    cin >> n >> q;
    vector<int> w(n + 1);
    for (int i = 0; i < n; ++i) cin >> w[i];

    while (q--) {
        int l, r, k;
        cin >> l >> r >> k;
        int mx = 0;
        for (int a = l; a <= r; ++a) {
            for (int b = a + 1; b <= r; ++b) {
                if (w[a] > w[b]) mx = max(mx, w[a] + w[b]);
            }
        }
        if (mx <= k) cout << "1\n";
        else cout << "0\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...