Submission #58338

#TimeUsernameProblemLanguageResultExecution timeMemory
58338PeppaPigRice Hub (IOI11_ricehub)C++14
26 / 100
9 ms748 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; const int N = 5e3 + 5; long long sum[N]; int besthub(int R, int L, int X[], long long B) { for(int i = 1; i <= R; i++) sum[i] = sum[i - 1] + X[i - 1]; int res = 0; int l = 0, r = R; while(l <= r) { int mid = (l + r) >> 1; int m = mid >> 1; long long ret = LLONG_MAX; for(int i = 1; i <= R - mid + 1; i++) { if(mid == 1) ret = min(ret, 0LL); if(mid == 2) ret = min(ret, (long long)(X[i + 1] - X[i])); else { long long t = sum[i + mid - 1] - sum[i + m] - sum[i + m - 1] + sum[i - 1]; if(mid & 1) ret = min(ret, t); else ret = min(ret, t + X[i + m - 1]); } } if(ret <= B) res = mid, l = mid + 1; 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...