| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1325457 | kasamchi | Rice Hub (IOI11_ricehub) | C++20 | 1095 ms | 568 KiB |
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B) {
int rr = 0, ret = 0;
for (int ll = 0; ll < R; ll++) {
while (rr < R) {
long long b = 0;
for (int i = ll; i <= rr; i++) {
b += abs(X[i] - X[ll + (rr - ll) / 2]);
}
if (b > B) {
break;
}
rr++;
}
ret = max(ret, rr - ll);
}
return ret;
}
| # | 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... | ||||
