제출 #330932

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
330932		nvmdava	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	100 / 100	1107 ms	103916 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1'000'005;
const ll MOD = 1'000'000'007;
const int INF = 0x3f3f3f3f;

int w[N], ans[N];
vector<int> t;
vector<pair<int, int> > v[N];
vector<pair<pair<int, int>, int> > q[N];

int fen[N];

int query(int r){
    int mx = 0;
    while(r){
        mx = max(mx, fen[r]);
        r -= r & -r;
    }
    return mx;
}

void update(int r, int x){
    while(r < N){
        fen[r] = max(fen[r], x);
        r += r & -r;
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

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

    for(int i = 1; i <= n; ++i)
        cin>>w[i];

    for(int i = 1; i <= n; ++i){
        while(!t.empty() && w[t.back()] <= w[i])
            t.pop_back();
        if(!t.empty())
            v[t.back()].push_back({i, w[i] + w[t.back()]});
        t.push_back(i);
    }

    for(int i = 1; i <= m; ++i){
        int l, r, k;
        cin>>l>>r>>k;
        q[l].push_back({{r, k}, i});
    }

    for(int i = n; i > 0; --i){
        for(auto& x : v[i])
            update(x.ff, x.ss);
        for(auto& x : q[i])
            ans[x.ss] = (query(x.ff.ff) <= x.ff.ss);
    }
    for(int i = 1; i <= m; ++i)
        cout<<ans[i]<<'\n';
}

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