oj.uz

답안 #834828

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834828 2023-08-22T20:49:00 Z JakobZorz 사탕 분배 (IOI21_candies) C++17
0 / 100
 567 ms 34824 KB 
#include"candies.h"
#include<iostream>
#include<vector>
#include<limits.h>
using namespace std;
typedef long long ll;
 
ll n,days;
const ll TREE_SIZE=1<<18;
 
vector<ll>mn;
vector<ll>mx;
vector<ll>lazy;
void tree_init(){
    mn.resize(TREE_SIZE*2);
    mx.resize(TREE_SIZE*2);
    lazy.resize(TREE_SIZE*2);
}
 
void update_lazy(ll node){
    if(lazy[node]==0)
        return;
    mx[node]+=lazy[node];
    mn[node]+=lazy[node];
    
    if(node<TREE_SIZE){
        lazy[2*node]+=lazy[node];
        lazy[2*node+1]+=lazy[node];
    }
    lazy[node]=0;
}
 
void update_node(ll node){
    update_lazy(node);
    if(node>=TREE_SIZE){
        mn[node]=mx[node];
        return;
    }
    
    update_lazy(2*node);
    update_lazy(2*node+1);
    mn[node]=min(mn[2*node],mn[2*node+1]);
    mx[node]=max(mx[2*node],mx[2*node+1]);
}
 
void tree_add(ll node,ll l,ll r,ll pos,ll val){
    //cout<<l<<" "<<r<<endl;
    if(r<=pos)
        return;
    
    if(pos<=l){
    //if(node>=TREE_SIZE){
        lazy[node]+=val;
        update_node(node);
        return;
    }
    
    ll m=(l+r)/2;
    tree_add(2*node,l,m,pos,val);
    tree_add(2*node+1,m,r,pos,val);
    update_node(node);
}
 
void tree_add(ll pos,ll val){
    tree_add(1,0,TREE_SIZE,pos,val);
}
 
pair<pair<ll,ll>,ll>tree_get2(ll node,ll l,ll r,ll p_max,ll p_min,ll bound){
    //cout<<l<<" "<<r<<"\n";
    update_node(node);
    if(node>=TREE_SIZE)
        return {{max(p_max,mx[node]),min(p_min,mn[node])},l};
    
    ll p_max2=max(p_max,mx[2*node+1]);
    ll p_min2=min(p_min,mn[2*node+1]);
    //cout<<"pmax2 "<<p_max2<<" pmin2 "<<p_min2<<"\n";
    ll m=(l+r)/2;
    
    if(p_max2-p_min2<bound){
        return tree_get2(2*node,l,m,p_max2,p_min2,bound);
    }else{
        return tree_get2(2*node+1,m,r,p_max,p_min,bound);
    }
}

ll get_idx(ll node,ll l,ll r,ll idx){
    update_node(node);
    if(node>=TREE_SIZE)
        return mn[node];
    
    ll m=(l+r)/2;
    if(idx>=m)
        return get_idx(2*node,l,m,idx);
    else
        return get_idx(2*node+1,m,r,idx);
}
 
ll tree_get(ll bound){
    /*for(int i=0;i<days;i++)
        cout<<mn[TREE_SIZE+i]<<" ";
    cout<<endl;*/
    update_node(1);
    if(mx[1]-mn[1]<bound){
        //cout<<"a"<<endl;
        return get_idx(1,0,TREE_SIZE,days-1)-mn[1];
    }
    
    auto res=tree_get2(1,0,TREE_SIZE,LLONG_MIN,LLONG_MAX,bound);
    //cout<<res.first.first<<" "<<res.first.second<<" "<<res.second<<"\n";=
    
    if(res.first.first==get_idx(1,0,TREE_SIZE,res.second)){
        //cout<<"b"<<endl;
        return get_idx(1,0,TREE_SIZE,days-1)-res.first.second;
    }else{
        //cout<<"c "<<bound<<" "<<bound-(res.first.first-get_idx(1,0,TREE_SIZE,days-1))<<endl;
        return bound-(res.first.first-get_idx(1,0,TREE_SIZE,days-1));
    }
}
 
vector<int>distribute_candies(vector<int>c,vector<int>l,vector<int>r,vector<int>v){
    n=c.size();
    days=v.size()+1;
    vector<vector<pair<ll,ll>>>events;
    events.resize(n+1);
    
    for(ll i=0;i<days-1;i++){
        events[l[i]].push_back({i+1,v[i]});
        events[r[i]+1].push_back({i+1,-v[i]});
    }
    
    vector<int>s(n);
    tree_init();
    
    for(ll i=0;i<n;i++){
        for(auto event:events[i])
            tree_add(event.first,event.second);
        s[i]=tree_get(c[i]);
    }
    
    //return {};
    return s;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 12628 KB Output is correct
2 Incorrect 5 ms 12628 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 567 ms 34824 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 12628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 12628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 12628 KB Output is correct
2 Incorrect 5 ms 12628 KB Output isn't correct
3 Halted 0 ms 0 KB -