# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
235556 | Toirov_Sadi | Rice Hub (IOI11_ricehub) | C++17 | 8 ms | 768 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int n, int L, int X[], long long B){
int res = 0;
vector<long long> p(n, 0);
for(int i = 0; i < n; i ++){
if(i > 0) p[i] = p[i - 1];
p[i] += X[i];
}
int l = 0, r = n;
while(l < r){
int m = (l + r) / 2;
/// can m ?
bool can = false;
for(int i = 0; i + m < n; i ++){
int l1 = i, r1 = i + m;
int mid = (l1 + r1) / 2;
int x = m / 2;
int y = m - (m / 2);
long long cur = x * 1ll * X[i] - (p[mid] - p[l1 - 1]);
cur += (p[r1] - p[mid]) - y * 1ll * X[i];
if(cur <= B) can = true;
}
if(can == true){
l = m + 1;
}
else{
r = m;
}
}
return l;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |