제출 #1217114

#제출 시각아이디문제언어결과실행 시간메모리
1217114nataliaaRice Hub (IOI11_ricehub)C++20
0 / 100
0 ms320 KiB
#include "ricehub.h" #include<bits/stdc++.h> using namespace std; int besthub(int R, int L, int X[], long long B) { long long ans = 0; int l = 0, r = R; long long pre[R+1]={}; for(int i = 0; i< R; i++) pre[i+1]=pre[i]+X[i]; while(l<=r) { int m = (l+r)/2; bool t = 0; for(int i = 0; i < R ; i++) { if(i+m<=R) { int cnt = 0; int k = (m+i-1)/2; cnt+=(k - i)*X[k] - (pre[k] - pre[i]) + (pre[i+m] - pre[k +1]) - (i+m - k)*pre[k]; if(cnt<=B) { t=1; break; } } else break; } if(t) l = m+1; else r= m-1; } return r; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...