Submission #677697

#	Time	Username	Problem	Language	Result	Execution time	Memory
677697		Alcabel	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3053 ms	39076 KiB

sortbooks

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

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> w(n);
    for (int i = 0; i < n; ++i) {
        cin >> w[i];
    }
    for (int i = 0; i < m; ++i) {
        int l, r, k;
        cin >> l >> r >> k;
        --l, --r;
        bool able = true;
        for (int j = l + 1, mx = w[l]; j <= r; ++j) {
            if (mx > w[j] && mx + w[j] > k) {
                able = false;
                break;
            }
            mx = max(mx, w[j]);
        }
        cout << able << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }

    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