| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1027769 | stdfloat | Gap (APIO16_gap) | C++17 | 35 ms | 2864 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 "gap.h"
using namespace std;
using ll = long long;
ll findGap(int T, int N) {
ll s, t;
MinMax(0, (ll)1e18, &s, &t);
ll ans = 0;
while (N > 2 && s + 1 < t) {
ll x, y;
MinMax(s + 1, t - 1, &x, &y);
if (x == -1) break;
ans = max({ans, x - s, t - y});
s = x; t = y; N -= 2;
}
return max(ans, t - s);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
