# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1027602 | stdfloat | Gap (APIO16_gap) | C++17 | 0 ms | 0 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"
#include "grader.cpp"
using namespace std;
using ll = long long;
ll findGap(int T, int N) {
ll s = 0, t = (ll)1e18, ans = LLONG_MAX;
while (s + 1 < t) {
ll x, y;
MinMax(s + 1, t - 1, &x, &y);
if (x == -1) return min(ans, t - s);
ans = min({ans, x - s, t - y});
s = x; t = y;
}
return min(ans, t - s);
}