| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1346410 | ramzialoulou | Gap (APIO16_gap) | C++20 | 28 ms | 1216 KiB |
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
long long findGap(int T, int N) {
long long mn, mx;
MinMax(0, LLONG_MAX, &mn, &mx);
long long block = (mx - mn + N - 2) / (N - 1);
long long cur = mn, ans = 0;
long long last = cur;
while (cur < mx) {
long long l, r;
MinMax(cur, cur + block - 1, &l, &r);
if (l != -1) {
ans = max({ans, r - l, l - last});
ans = max(ans, r - l);
last = r;
}
cur += block;
}
ans = max(ans, mx - last);
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
