Submission #441470

#	Time	Username	Problem	Language	Result	Execution time	Memory
441470		daniel920712	Distributing Candies (IOI21_candies)	C++17	11 / 100	350 ms	33472 KiB

candies

#include "candies.h"

#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
using namespace std;
struct A
{
    long long l,r;
    long long big,small;
    long long add;
    A *nxl,*nxr;
    void build(long long ll,long long rr)
    {
        //printf("%lld %lld\n",ll,rr);
        l=ll;
        r=rr;
        add=0;
        if(rr==ll+1) return;
        nxl=(A*) malloc(sizeof(A));
        nxr=(A*) malloc(sizeof(A));
        nxl->build(ll,(ll+rr)/2);
        nxr->build((ll+rr)/2,rr);
    }
    void cha(long long ll,long long rr,long long con)
    {
        //printf("%lld %lld %lld %lld\n",l,r,ll,rr);
        if(l==ll&&r==rr)
        {
            add+=con;
            return;
        }
        if(rr<=(l+r)/2) nxl->cha(ll,rr,con);
        else if(ll>=(l+r)/2) nxr->cha(ll,rr,con);
        else
        {
            nxl->cha(ll,(l+r)/2,con);
            nxr->cha((l+r)/2,rr,con);
        }
    }
    long long Find(long long where)
    {
        if(where==l&&where+1==r) return add;
        if(where<(l+r)/2) return add+nxl->Find(where);
        else return add+nxr->Find(where);
    }
};
vector < int > ans;
vector < int > distribute_candies(vector < int > c, vector < int > l,vector < int > r, vector < int > v)
{
    long long N=(long long) c.size(),M=(long long) l.size(),i,j;
    if(N<=2000&&M<=2000)
    {
        for(i=0;i<N;i++) ans.push_back(0);
        for(i=0;i<M;i++)
        {
            for(j=l[i];j<=r[i];j++)
            {
                ans[j]+=v[i];
                ans[j]=max(0,ans[j]);
                ans[j]=min(ans[j],c[j]);
            }

        }
        return ans;
    }
    A* root=(A*) malloc(sizeof(A));
    root->build(0,N);
    for(i=0;i<M;i++) root->cha(l[i],r[i]+1,v[i]);
    //printf("aa\n");
    for(i=0;i<N;i++) ans.push_back((int) min((long long)c[i],root->Find(i)));
    return ans;
}
/*
5
1 2 3 4 5
2
0 2 1
1 4 5
*/

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