제출 #624340

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
624340		dqhungdl	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	889 ms	121496 KiB

sortbooks

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

#ifdef DEBUG
#include "debug.hpp"
#define debug(x...) cerr << "[" << #x << "] = [", _print(x)
#else
#define debug(x...)
#endif

#define int long long
struct Query {
    int l, w, id;
};

const int MAX = 1e6 + 5;
int n, Q, a[MAX], L[MAX], rs[MAX], tree[MAX];
vector<Query> g[MAX];

void update(int idx, int val) {
    for (int i = idx; i; i -= i & -i)
        tree[idx] = max(tree[idx], val);
}

int query(int idx) {
    int rs = 0;
    for (int i = idx; i <= n; i += i & -i)
        rs = max(rs, tree[i]);
    return rs;
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("../_input", "r", stdin);
#endif
    cin >> n >> Q;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        L[i] = i - 1;
        int tmp = i - 1;
        while (tmp && a[i] >= a[tmp])
            L[i] = tmp = L[tmp];
    }
    int l, r, w;
    for (int i = 1; i <= Q; i++) {
        cin >> l >> r >> w;
        g[r].push_back({l, w, i});
    }
    for (int i = 1; i <= n; i++) {
        if (L[i])
            update(L[i], a[L[i]] + a[i]);
        for (auto q: g[i])
            rs[q.id] = query(q.l) <= q.w;
    }
    for (int i = 1; i <= Q; i++)
        cout << rs[i] << '\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