제출 #372963

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
372963		smjleo	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3103 ms	262144 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define nl '\n'
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
const int mod = 1000000007;
const int mod2 = 998244353;

// change this
const int N = 1000005;

int n, m, a, b, c, arr[N], ans[N];
vector< vector<int> > queries[N];

struct node {
    node *l, *r;
    int s, e, m, maxi = 0, val = 0, lazy = 0;

    node(int _s, int _e): s(_s), e(_e), m((_s+_e)/2) {
        if (s == e) {
            maxi = arr[s];
        } else {
            l = new node(s, m), r = new node(m+1, e);
            maxi = max(l->maxi, r->maxi);
        }
    }

    int value() {
        val = max(lazy, val);
        int templazy = lazy;
        lazy = 0;
        if (!val) return 0;
        if (s == e) return maxi + val;
        if (templazy < l->maxi) l->lazy = max(templazy, l->lazy);
        if (templazy < r->maxi) r->lazy = max(templazy, r->lazy);
        return maxi + val;
    }

    void modify(int x, int y, int v) {
        if (y < x) return;
        if (v >= maxi) return;  // no element here can actually do this
        if (s == x && e == y) {
            lazy = max(lazy, v);
        } else {
            if (x > m) r->modify(x, y, v);
            else if (y <= m) l->modify(x, y, v);
            else l->modify(x, m, v), r->modify(m+1, y, v);
            val = max(l->lazy, r->lazy);
        }
    }

    int query(int x, int y) {
        value();
        if (s == x && e == y) return value();
        if (x > m) return r->query(x, y);
        if (y <= m) return l->query(x, y);
        return max(l->query(x, m), r->query(m+1, y));
    }
} *root;

signed main() {
    io;
    cin >> n >> m;
    for (int i=0; i<n; i++) cin >> arr[i];
    root = new node(0, n-1);
    for (int i=0; i<m; i++) {
        cin >> a >> b >> c;
        queries[b-1].push_back({a-1, c, i});
    }
    
    for (int i=0; i<n; i++) {
        root->modify(0, i-1, arr[i]);
        for (auto j : queries[i]) {
            int l = j[0], v = j[1], ai = j[2];
            ans[ai] = (root->query(l, i) <= v);
        }
    }
    
    for (int i=0; i<m; i++) cout << ans[i] << nl;
}

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