Submission #655690

#TimeUsernameProblemLanguageResultExecution timeMemory
655690benjaminkleynRice Hub (IOI11_ricehub)C++17
42 / 100
1074 ms1448 KiB
#include <bits/stdc++.h> #include "ricehub.h" using namespace std; typedef long long ll; ll pref[100001]; int *x; ll sum(int l, int r) { return pref[r+1] - pref[l]; } ll cost(int l, int r, int i) { return sum(i + 1, r) + x[i] * (2 * i - l - r) - sum(l, i - 1); } ll calc(int R, int X[], int cnt) { ll mn = LLONG_MAX; for (int l = 0, r = cnt - 1; r < R; l++, r++) for (int i = l; i <= r; i++) mn = min(mn, cost(l, r, i)); return mn; } int besthub(int R, int L, int X[], ll B) { x = X; pref[0] = 0; for (int i = 0; i < R; i++) pref[i + 1] = pref[i] + X[i]; int lo = 0, hi = R; while (lo < hi) { int mid = (lo + hi + 1) / 2; if (calc(R, X, mid) <= B) lo = mid; else hi = mid - 1; } return lo; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...