Submission #410825

#TimeUsernameProblemLanguageResultExecution timeMemory
410825LouayFarahRice Hub (IOI11_ricehub)C++14
0 / 100
39 ms332 KiB
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
    long long b;
    int sum = 0;
    for(int x = 1; x<=L; x++)
    {
        b = B;
        int l, r;
        l = lower_bound(X, X+R, x)-X+-1;
        r = l+2;
        int res = 0;
        while((r<R||l>=0)&&(b>=0))
        {
            if(l<0)
            {
                res++;
                b-=abs(x-X[r]);
                r++;
            }
            else if(r==R)
            {
                res++;
                b-=abs(x-X[l]);
                l--;
            }
            else if(abs(X[l]-x)<=abs(X[r]-x))
            {
                res++;
                b-=abs(x-X[l]);
                l--;
            }
            else if(abs(X[l]-x)>abs(X[r]-x))
            {
                res++;
                b-=abs(x-X[r]);
                r++;
            }
        }
        sum = max(sum , res);
    }

    return sum;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...