Submission #428523

#	Time	Username	Problem	Language	Result	Execution time	Memory
428523		FEDIKUS	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	1912 ms	95456 KiB

sortbooks

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define xx first
#define yy second
#define srt(a) sort(a.begin(),a.end());
#define srtg(a,int) sort(a.begin(),a.end(),greater<int>())
#define lb(a,x) lower_bound(a.begin(),a.end(),x)
#define up(a,x) upper_bound(a.begin(),a.end(),x)
#define fnd(a,x) find(a.begin(),a.end(),x)
#define vstart auto startt=chrono::system_clock::now()
#define vend auto endd=chrono::system_clock::now()
#define vvreme chrono::duration<double> vremee=endd-startt
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef string str;

const int maxn=1e6+10;
int niz[maxn];
int res[maxn];
int n,m;

vector<pair<pii,int> > query[maxn];

int segt[4*maxn];

void update(int t,int v,int ind=1,int l=0,int r=n-1){
    if(l==r){
        segt[ind]=v;
        return;
    }
    int mid=l+(r-l)/2;
    if(t<=mid) update(t,v,2*ind,l,mid);
    else update(t,v,2*ind+1,mid+1,r);
    segt[ind]=max(segt[2*ind],segt[2*ind+1]);
}

int upit(int tl,int tr,int ind=1,int l=0,int r=n-1){
    if(tl<=l && r<=tr) return segt[ind];
    int mid=l+(r-l)/2;
    int ret=0;
    if(tl<=mid) ret=max(ret,upit(tl,tr,2*ind,l,mid));
    if(tr>mid) ret=max(ret,upit(tl,tr,2*ind+1,mid+1,r));
    return ret;
}

void solve(){
    cin>>n>>m;
    for(int i=0;i<n;i++) cin>>niz[i];
    for(int i=0;i<m;i++){
        int l,r,a;
        cin>>l>>r>>a;
        query[r].pb(mp(mp(l,a),i));
    }
    stack<pii> nesto;
    for(int i=0;i<n;i++){
        while(!nesto.empty() && nesto.top().xx<niz[i]){
            nesto.pop();
        }
        if(!nesto.empty()) update(nesto.top().yy,nesto.top().xx+niz[i]);
        for(auto j:query[i]){
            if(upit(j.xx.xx,i)>j.xx.yy){
                res[j.yy]=0;
            }else res[j.yy]=1;
        }
        nesto.push(mp(niz[i],i));
    }
    for(int i=0;i<m;i++) cout<<res[i]<<"\n";
}

int main(){
    ios;
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}

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