Submission #1352179

#	Time	Username	Problem	Language	Result	Execution time	Memory
1352179		fggg	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	3094 ms	16096 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
void solve() {
    ll n, q;
    cin >> n >> q;
    vector<ll> a(n);
    for (ll& x : a) cin >> x;
    while (q--) {
        ll l, r, k;
        cin >> l >> r >> k;
        l--, r--;
        vector<ll> b = a;
        ll ans = 1;
        for (ll _ = 0; _ < r - l; _++) {
            ll pmi = l + _;
            for (ll j = l + _; j <= r; j++) {
                if (b[j] < b[pmi]) pmi = j;
            }
            for (ll j = pmi - 1; j >= l; j--) {
                if (b[j] + b[j + 1] <= k) swap(b[j], b[j + 1]);
                else ans = 0;
            }
        }
        cout << ans << '\n';
    }
}
signed main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    ll t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

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