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);
int cnt = 1;
ll ans = LLONG_MAX;
while (N > 2 && s + 1 < t) {
cnt++;
assert(cnt <= (N + 1) / 2 && (N & 1));
ll x, y;
MinMax(s + 1, t - 1, &x, &y);
if (x == -1) break;
ans = min({ans, x - s, t - y});
s = x; t = y; N -= 2;
}
return min(ans, (s < t ? t - s : LLONG_MAX));
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |