제출 #1156434

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1156434		hashimali	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	1247 ms	129820 KiB

sortbooks

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define ld long double
#define pb push_back
#define pf push_front
#define mod 998244353
#define se second
#define fi first
#define all(ls) (ls).begin(),(ls).end()
#define int long long
using namespace std;
using namespace __gnu_pbds;
template<typename type>using ordered_set=tree<type,null_type,less<type>,rb_tree_tag,tree_order_statistics_node_update>;
template<typename type>using ordered_multiset=tree<type,null_type,less_equal<type>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=1e6+10;
int a[N],seg[4*N];
void upd(int v,int st,int en,int ind,int val){
    if(st==en){
        seg[v]=val;
        return;
    }
    int mid=(st+en)/2;
    if(st<=ind and ind<=mid)
        upd(v*2+1,st,mid,ind,val);
    if((mid+1)<=ind and ind<=en)
        upd(v*2+2,mid+1,en,ind,val);
    seg[v]=max(seg[v*2+1],seg[v*2+2]);
}
int get(int v,int st,int en,int l,int r){
    if(st>en or en<l or st>r)
        return 0;
    if(st>=l and en<=r)
        return seg[v];
    int mid=(st+en)/2;
    return max(get(v*2+1,st,mid,l,r),get(v*2+2,mid+1,en,l,r));
}
void solve(){
    int n,q;
    cin>>n>>q;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    vector<vector<int>>Q[n];
    for(int i=0;i<q;i++){
        int l,r,k;
        cin>>l>>r>>k;
        l--;r--;
        Q[l].pb({r,i,k});
    }
    int ans[q];
    stack<int>dq;
    for(int i=n-1;i>=0;i--){
        while(dq.size() and a[dq.top()]<=a[i]){
            if(a[dq.top()]<=a[i])
                upd(0,0,n+1,dq.top(),a[dq.top()]+a[i]);
            dq.pop();
        }
        dq.push(i);
        for(vector<int> j:Q[i]){
            ans[j[1]]=(get(0,0,n+1,i,j[0])<=j[2]);
        }
    }
    for(int i=0;i<q;i++)
        cout<<ans[i]<<endl;
}  
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    // cin>>t
    for(int i=1;i<=t;i++){
        // cout<<"Scenario #"<<i<<":"<<" ";
        solve();
    }
}

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