Submission #1156299

#	Time	Username	Problem	Language	Result	Execution time	Memory
1156299		hashimali	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	30 / 100	1184 ms	34544 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>;
int n,q,l,r,k;
const int N=1e6+10;
int a[N],seg[4*N];
vector<pair<int,int>>subs;
bool comp(pair<int,int>a,pair<int,int>b){
    if(a.fi==b.fi)
        return a.se<b.se;
    return a.fi<b.fi;
}
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]=min(seg[v*2+1],seg[v*2+2]);
}
int get(int v,int st,int en,int l,int r){
    if(st>en or st>r or en<l)
        return LLONG_MAX;
    if(l<=st and en<=r)
        return seg[v];
    int mid=(st+en)/2;
    return min(get(v*2+1,st,mid,l,r),get(v*2+2,mid+1,en,l,r));
}
void subtask1(){
    int ans=0;
    int low=0,high=subs.size()-1;
    while(low<=high){
        int mid=(low+high)/2;
        if(subs[mid].fi>l)
            high=mid-1;
        else if(subs[mid].se<r)
            low=mid+1;
        else{
            ans=1;
            break;
        }
    }
    cout<<ans<<endl;
}
void subtask23(){
    set<int>st;
    int ans=1;
    for(int i=l;i<=r;i++){
        if(st.size() and a[i]<(*st.rbegin()) and (a[i]+*st.rbegin())>k){
            ans=0;
            break;
        }
        st.insert(a[i]);
    }
    cout<<ans<<endl;
}
void solve(){
    cin>>n>>q;
    for(int i=0;i<n;i++){
        cin>>a[i];
        upd(0,0,n+1,i,a[i]);
    }
    int cnt=1;
    for(int i=1;i<n;i++){
        if(a[i-1]<=a[i])
            cnt++;
        else{
            subs.pb({i-cnt,i-1});
            cnt=1;
        }
    }
    subs.pb({(n-1)-cnt+1,n-1});
    sort(all(subs),comp);
    while(q--){
        cin>>l>>r>>k;
        l--;r--;
        if(get(0,0,n+1,l,r)>=k)
            subtask1(); 
        else if(n<=5000)
            subtask23();
        else
            cout<<0<<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: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 13 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23