Submission #526562

#	Time	Username	Problem	Language	Result	Execution time	Memory
526562		ToroTN	Rice Hub (IOI11_ricehub)	C++14	100 / 100	17 ms	3304 KiB

ricehub

#include<bits/stdc++.h>
using namespace std;
#include "ricehub.h"
long long n,m,a[100005],b,st,md,ed,qs[100005],l,r,siz,md1,md2,type;
long long query(long long l,long long r)
{
    return qs[r]-qs[l-1];
}
int besthub(int R,int L,int X[],long long B)
{
    n=(long long)R;
    m=(long long)L;
    for(int i=1;i<=n;i++)
    {
        a[i]=(long long)X[i-1];
        qs[i]=qs[i-1]+a[i];
    }
    b=B;
    st=1;
    ed=n;
    /*for(int i=1;i<=n;i++)
    {
        printf("%lld ",qs[i]);
    }
    printf("\n");*/
    while(ed>=st)
    {
        md=(st+ed)/2;
        siz=md/2;
        type=-1;
        for(int i=1;i<=n-md+1;i++)
        {
            l=i;
            r=i+md-1;
            md1=l+siz-1;
            md2=r-siz+1;
            if(query(md2,r)-query(l,md1)<=b)
            {
                type=0;
            }
        }
        if(type==0)
        {
            st=md+1;
        }else
        {
            ed=md-1;
        }
    }
    //printf("%lld %lld %lld\n",st,md,ed);
    return ed;
}

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32