제출 #556263

#제출 시각아이디문제언어결과실행 시간메모리
556263Dan4Life쌀 창고 (IOI11_ricehub)C++17
0 / 100
1087 ms596 KiB
#include "ricehub.h" //#include "grader.cpp" #include <bits/stdc++.h> using namespace std; #define ll long long ll pref[100010]; ll sum(int i, int j){ return pref[j+1]-pref[i]; } int besthub(int n, int m, int a[], ll k) { pref[0] = 0; for(int i = 0; i < n; i++) pref[i+1] = pref[i]+a[i]; int l = 1, r = n; while(l<r){ ll mid = (l+r)/2, mn = (ll)4e18; for(int i = 0; i <= n-mid; i++){ int j = i+mid-1; int med = (i+j)/2; if(med>=i and med<=j) mn = min(mn, (ll)a[med]*(med-i+1)-sum(i,med)+sum(med+1,j)-a[med]*(j-med)); med--; if(med>=i and med<=j) mn = min(mn, (ll)a[med]*(med-i+1)-sum(i,med)+sum(med+1,j)-a[med]*(j-med)); med+=2; if(med>=i and med<=j) mn = min(mn, (ll)a[med]*(med-i+1)-sum(i,med)+sum(med+1,j)-a[med]*(j-med)); } if(mn<=k) l=mid; else r = mid-1; } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...