| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1334074 | ElayV13 | 쌀 창고 (IOI11_ricehub) | C++20 | 1094 ms | 436 KiB |
#include "ricehub.h"
#include "bits/stdc++.h"
using namespace std;
int besthub(int R,int L,int X[],long long B)
{
int res=0;
for(int p=1;p<=L;p++)
{
for(int i=0;i<R;i++)
{
int l=i,r=R-1,mx=-1;
while(l<=r)
{
int mid=(l+r)>>1;
int need=0;
for(int ii=i;ii<=mid;ii++) need+=abs(X[ii]-p);
//if(i==2&&p==11&&mid==4) cout<<need<<endl;
if(need<=B)
{
mx=max(mx,mid);
l=mid+1;
}
else r=mid-1;
}
if(mx!=-1) res=max(res,mx-i+1);
}
}
return res;
}
| # | 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... | ||||
