Submission #1216148

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216148		nh0902	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	8 / 100	3096 ms	4164 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 5e5 + 10;

int n, m, q, w[N];


void prep() {
    cin >> n >> q;
    vector<pair<int, int>> v;
    for (int i = 1; i <= n; i ++) {
        cin >> w[i];
    }
}

void solve() {
    int l, r, k;
    while (q --) {
        cin >> l >> r >> k;
        int max_pair = 0;
        for (int i = l; i <= r; i ++) {
            for (int j = i + 1; j <= r; j ++) {
                if (w[i] > w[j]) max_pair = max(max_pair, w[i] + w[j]);
            }
        }
        if (max_pair <= k) cout << 1 << "\n";
        else cout << 0 << "\n";
    }
    //cout << get(ver[m], 1, n, 1, n).first;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    prep();
    solve();

    return 0;
}

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