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 "gap.h"
#include "bits/stdc++.h"
using namespace std;
long long findGap(int T, int N) {
long long mn, mx;
MinMax(0, LLONG_MAX, &mn, &mx);
if (N == 2) {
return mx - mn;
}
int x = 0;
long long ret = 0;
long long cur = mn;
while (cur < mx) {
x++;
long long b = (mx - mn + N - x) / (N - x) - 1;
if (b == 0) {
break;
}
int cnt = 0;
long long s, z;
long long ccur = cur;
while (true) {
MinMax(ccur + 1, ccur + b, &s, &z);
if (z == -1) {
cnt++;
ccur += b;
} else {
ret = max(ret, s - cur);
ccur = s;
break;
}
}
cur = ccur;
}
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |