Submission #1302747

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302747		chithanhnguyen	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	34 / 100	3093 ms	10220 KiB

sortbooks

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

#define int long long
#define ld long double
#define pii pair<int, int>
#define fi first
#define se second
#define __builtin_popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) ((1ll << (x)))

#define debug(a, l, r) for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';

const int MAXN = 1e6 + 6;
int n, m, w[MAXN];

signed main() {
    #ifdef NCTHANH
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr); cout.tie(nullptr);

    cin >> n >> m;
    for (int i = 1; i <= n; ++i) cin >> w[i];

    while (m--) {
        int l, r, k; cin >> l >> r >> k;
        bool flag = 1;
        int premx = 0;
        for (int i = l; i <= r; ++i) {
            if (premx > w[i] && premx + w[i] > k) {
                flag = 0;
            }

            premx = max(premx, w[i]);
            if (!flag) break;
        }

        cout << flag << '\n';
    }

    return 0;
}

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