# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
655232 | Dremix10 | Rice Hub (IOI11_ricehub) | C++17 | 1095 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "ricehub.h"
int besthub(int R, int L, int X[], long long B)
{
int p=0,k=1,result;
for(int i=R;i>=0;i--)
{
for(int j=0;j<=R-i;j++)
{
int t=j+i;
int mid=X[(t-1+j)/2];
int countt=0;
for(int o=j;o<t;o++)
countt+=abs(mid-X[o]);
if(countt<=B){
result=i;
k=0;
break;
}
}
if(k==0)break;
}
return result;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |