Submission #753282

#TimeUsernameProblemLanguageResultExecution timeMemory
753282acceptifyRice Hub (IOI11_ricehub)C++17
68 / 100
1068 ms1712 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; int besthub(int R, int L, int X[], long long B){ auto calc = [&] (int l, int r, int p) -> long long { long long sum = 0; for (int i = l; i <= r; i++) sum += abs(X[i] - X[p]); return sum; }; int l = 0, r = R, res = 0; while (l <= r) { int mid = (l + r) / 2; long long cost = 1e18; for (int i = 0; i + mid - 1 < R; i++) { int p = (i + i + mid - 1) / 2; cost = min({cost, calc(i, i + mid - 1, p), calc(i, i + mid - 1, p + 1)}); } if (cost <= B) l = mid + 1, res = mid; else r = mid - 1; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...