제출 #1268874

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1268874		imarn	사탕 분배 (IOI21_candies)	C++20	100 / 100	1332 ms	43880 KiB

candies

//#include "festival.h"
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
#define lb(x,i) lower_bound(all(x),i)-x.begin()
#define sz(x) (ll)x.size()
#define cd complex<double>
#define t3 tuple<ll,ll,ll>
using namespace std;
const int mxn=2e5+5;
int n,q;
struct lzseg{
    pll t[4*mxn];
    ll lz[4*mxn]{0};
    void build(int i,int l,int r){
        if(l==r)return void(t[i]={0,l});
        int m=(l+r)>>1;build(2*i,l,m);build(2*i+1,m+1,r);
        t[i]=max(t[2*i],t[2*i+1]);
    }
    void push(int i,int l,int r){
        t[i].f+=lz[i];
        if(l<r)lz[2*i]+=lz[i],lz[2*i+1]+=lz[i];
        lz[i]=0;
    }
    void update(int i,int l,int r,int tl,int tr,ll v){
        push(i,l,r);
        if(r<tl||l>tr)return;
        if(r<=tr&&l>=tl){
            lz[i]+=v;push(i,l,r);return;
        }int m=(l+r)>>1;
        update(2*i,l,m,tl,tr,v);update(2*i+1,m+1,r,tl,tr,v);
        t[i]=max(t[2*i],t[2*i+1]);
    }
    pll qr(int i,int l,int r,int tl,int tr){
        push(i,l,r);
        if(r<tl||l>tr)return {-1e16,-1};
        if(r<=tr&&l>=tl)return t[i];
        int m=(l+r)>>1;
        return max(qr(2*i,l,m,tl,tr),qr(2*i+1,m+1,r,tl,tr));
    }
}sg[2];vector<pii>upd[mxn];
vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,std::vector<int> r, std::vector<int> v){
    n=c.size(),q=v.size();vector<int>ans(n);sg[0].build(1,0,q);sg[1].build(1,0,q);
    for(int i=0;i<q;i++)upd[l[i]].pb({v[i],i+1}),upd[r[i]+1].pb({-v[i],i+1});
    for(int i=0;i<n;i++){
        for(auto [val,id] : upd[i])sg[0].update(1,0,q,id,q,val),sg[1].update(1,0,q,id,q,-val);
        pll mx=sg[0].qr(1,0,q,0,q),mn=sg[1].qr(1,0,q,0,q);mn.f=-mn.f;
        if(mx.f-mn.f<c[i]){
            ans[i]=sg[0].qr(1,0,q,q,q).f-min(mn.f,1ll*0);
            continue;
        }int tl=0,tr=q;
        while(tl<tr){
            int m=(tl+tr+1)>>1;
            if(sg[0].qr(1,0,q,m,q).f+sg[1].qr(1,0,q,m,q).f>=c[i])tl=m;
            else tr=m-1;
        }mx=sg[0].qr(1,0,q,tl,q),mn=sg[1].qr(1,0,q,tl,q);mn.f=-mn.f;
        if(mn.s>mx.s){
            ans[i]=sg[0].qr(1,0,q,q,q).f-mn.f;
        }else{
            ans[i]=sg[0].qr(1,0,q,q,q).f-mx.f+c[i];
        }
    }return ans;
}
/*int main(){
    ve[-ctor<int>rs=distribute_candies({10, 15, 13},{0, 0},{2, 1},{20, -11});
    for(auto it : rs)cout<<it<<' ';
}*/

• Subtask 1: 3 / 3
• Subtask 2: 8 / 8
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29
• Subtask 5: 33 / 33