| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 410781 | LouayFarah | 쌀 창고 (IOI11_ricehub) | C++14 | 0 ms | 0 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"
using namespace std;
int besthub(long long R, long long L, long long X[], long long B)
{
if(R==1)
return 1;
long long mediane = X[R/2];
cout << mediane << endl;
long long l = R/2-1, r = R/2+1;
long long res = 1;
while((r<R||l>=0)&&(B>=0))
{
cout << l << ' ' << r << endl;
if(l<0)
{
res++;
B-=abs(mediane-X[r]);
r++;
}
else if(r==R)
{
res++;
B-=abs(mediane-X[l]);
l--;
}
else if(abs(X[l]-mediane)<=abs(X[r]-mediane))
{
res++;
B-=abs(mediane-X[l]);
l--;
}
else if(abs(X[l]-mediane)>abs(X[r]-mediane))
{
res++;
B-=abs(mediane-X[r]);
r++;
}
}
return res-1;
}