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, t;
MinMax(0, (ll)1e18, &s, &t);
ll d = (t - s - 1) / (n - 1);
vector<ll> v = {s};
while (s + 1 < t) {
ll x, y;
MinMax(s + 1, min(s + d, t - 1), &x, &y);
if (x != -1) v.insert(v.end(), {x, y});
s += d;
}
ll mx = 0;
for (int i = 1; i < (int)v.size(); i++) mx = max(mx, v[i] - v[i - 1]);
return max(mx, t - v.back());
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |