Submission #919829

#	Time	Username	Problem	Language	Result	Execution time	Memory
919829		VMaksimoski008	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3030 ms	38004 KiB

sortbooks

#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int32_t main() {
    setIO();

    int n, m;
    cin >> n >> m;

    vector<int> v(n);
    for(int &x : v) cin >> x;

    while(m--) {
        int l, r, k;
        cin >> l >> r >> k;
        multiset<int> ms;

        bool ok = 1;

        for(int i=l; i<=r; i++) {
            if(!ms.empty() && *ms.rbegin() > v[i] && ll(*ms.rbegin()) + ll(v[i]) > k) {
                ok = 0;
                break;
            }
            ms.insert(v[i]);
        }

        cout << ok << '\n';
    }

    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