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;
long long findGap(int T, int N) {
long long l, r, z, iv, ls = -1, rs = 0, a, b, i;
MinMax(0, 1000000000000000000, &l, &r);
z = l;
iv = max((r - l) / N - 1, 1LL);
for (i = 0; i < N * 2; ++i) {
a = z + i * iv;
b = z + (i + 1) * iv;
MinMax(a, b, &l, &r);
if (l < 0 && r < 0) continue;
if (ls > -1) rs = max(rs, l - ls);
ls = r;
}
return rs;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |