oj.uz

Submission #814979

# Submission time Handle Problem Language Result Execution time Memory
814979 2023-08-08T11:30:57 Z blackyuki Distributing Candies (IOI21_candies) C++17
100 / 100
 1325 ms 34852 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<bool> vb;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(a) a.begin(),a.end()
#define fi first
#define se second
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
const ll inf=1001001001001001001;
#include "candies.h"

struct segtree{
    ll N=1;
    vp seg;
    vi lazy;
    P f(P a,P b){
        return P(max(a.fi,b.fi),min(a.se,b.se));
    }
    segtree(ll n){
        while(N<n)N<<=1;
        seg=vp(N*2,P(-inf,inf));lazy=vi(N*2);
        rep(i,n)seg[i+N]=P(0,0);
        for(ll i=N-1;i>0;i--)seg[i]=f(seg[i*2],seg[i*2+1]);
    }
    void eval(ll k,ll l,ll r){
        seg[k].fi+=lazy[k];seg[k].se+=lazy[k];
        if(r-l>1){
            lazy[k*2]+=lazy[k];
            lazy[k*2+1]+=lazy[k];
        }
        lazy[k]=0;
    }
    void add(ll x,ll a,ll b,ll k=1,ll l=0,ll r=-1){
        if(r==-1)r=N;
        if(a<=l&&r<=b){
            lazy[k]+=x;
            eval(k,l,r);
            return;
        }
        if(r<=a||b<=l){
            eval(k,l,r);return;
        }
        eval(k,l,r);
        add(x,a,b,k*2,l,(l+r)/2);
        add(x,a,b,k*2+1,(l+r)/2,r);
        seg[k]=f(seg[k*2],seg[k*2+1]);
    }
    P get(ll a,ll b,ll k,ll l,ll r){
        if(a<=l&&r<=b){
            eval(k,l,r);
            return seg[k];
        }
        if(r<=a||b<=l)return P(-inf,inf);
        eval(k,l,r);
        return f(get(a,b,k*2,l,(l+r)/2),get(a,b,k*2+1,(l+r)/2,r));
    }
    ll getma(ll a,ll b){
        return get(a,b,1,0,N).fi;
    }
    ll getmi(ll a,ll b){
        return get(a,b,1,0,N).se;
    }
    ll getdif(ll a,ll b){
        P res=get(a,b,1,0,N);
        return res.fi-res.se;
    }
};
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) {
    ll n=c.size(),q=v.size();
    vvp event(n+1);
    rep(i,q){
        event[l[i]].pb(q-i,-v[i]);
        event[r[i]+1].pb(q-i,v[i]);
    }
    segtree seg(q+1);
    vector<int> res(n);
    rep(i,n){
        for(P x:event[i])seg.add(x.se,x.fi,q+1);
        ll ok=q+1,ng=-1;
        while(ok-ng>1){
            ll md=(ok+ng)/2;
            if(seg.getdif(0,md+1)>=c[i])ok=md;
            else ng=md;
        }
        if(ok==q+1||seg.getma(0,ok+1)==seg.getma(ok,ok+1))res[i]=-seg.getmi(0,ok+1);
        else res[i]=c[i]-seg.getma(0,ok+1);
    }
    return res;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 5 ms 616 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1156 ms 34816 KB Output is correct
2 Correct 1187 ms 34832 KB Output is correct
3 Correct 1161 ms 34816 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 297 ms 26224 KB Output is correct
3 Correct 332 ms 7608 KB Output is correct
4 Correct 1186 ms 34836 KB Output is correct
5 Correct 1263 ms 34828 KB Output is correct
6 Correct 1164 ms 34840 KB Output is correct
7 Correct 1102 ms 34844 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 149 ms 23872 KB Output is correct
4 Correct 288 ms 7568 KB Output is correct
5 Correct 887 ms 30636 KB Output is correct
6 Correct 867 ms 30656 KB Output is correct
7 Correct 838 ms 30652 KB Output is correct
8 Correct 873 ms 30656 KB Output is correct
9 Correct 875 ms 30648 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 5 ms 616 KB Output is correct
6 Correct 1156 ms 34816 KB Output is correct
7 Correct 1187 ms 34832 KB Output is correct
8 Correct 1161 ms 34816 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 297 ms 26224 KB Output is correct
11 Correct 332 ms 7608 KB Output is correct
12 Correct 1186 ms 34836 KB Output is correct
13 Correct 1263 ms 34828 KB Output is correct
14 Correct 1164 ms 34840 KB Output is correct
15 Correct 1102 ms 34844 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 149 ms 23872 KB Output is correct
19 Correct 288 ms 7568 KB Output is correct
20 Correct 887 ms 30636 KB Output is correct
21 Correct 867 ms 30656 KB Output is correct
22 Correct 838 ms 30652 KB Output is correct
23 Correct 873 ms 30656 KB Output is correct
24 Correct 875 ms 30648 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 305 ms 7620 KB Output is correct
27 Correct 313 ms 26304 KB Output is correct
28 Correct 1212 ms 34852 KB Output is correct
29 Correct 1133 ms 34820 KB Output is correct
30 Correct 1133 ms 34816 KB Output is correct
31 Correct 1287 ms 34816 KB Output is correct
32 Correct 1325 ms 34820 KB Output is correct