Submission #561901

#	Time	Username	Problem	Language	Result	Execution time	Memory
561901		Stickfish	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	3089 ms	14192 KiB

sortbooks

#include <iostream>
using namespace std;
using ll = long long;

const ll INF = 1e9 + 177013;
const int MAXN = 1e6 + 123;
int w[MAXN];

int get_max(int l, int r) {
    int mx = -INF;
    int ans = 0;
    for (int i = 0; i < r; ++i) {
        if (mx > w[i])
            ans = max(ans, mx + w[i]);
        else
            mx = w[i];
    }
    return ans;
}

signed main() {
    int n, m;
    cin >> n >> m;
    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;
        if (get_max(l, r) > k) {
            cout << 0 << '\n';
        } else {
            cout << 1 << '\n';
        }
    }
}

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