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;
using pii = pair<int, int>;
ll ans[100005];
long long findGap(int T, int N) {
ll l = 0, r = 1e18 + 500;
ll mn, mx;
MinMax(l, r, &mn, &mx);
l = mn, r = mx;
ll len = (r - 1) - (l + 1) + 1;
if (N == 2) return r - l;
ll b = len / N;
if (len % N) b++;
ll ret = 0;
ll p = l;
while (l < r) {
MinMax(l, l + b, &mn, &mx);
l += b;
if (mn == -1 && mx == -1) continue;
ret = max(ret, mn - p);
ret = max(ret, mx - mn);
p = mx;
}
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |