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"
#ifdef MINA
#include "grader.cpp"
#endif
using namespace std;
#define ll long long
const ll inf = 1e18;
ll findGap(int t, int n) {
ll s, e;
MinMax(0, inf, &s, &e);
if (n == 2) {
return e - s;
}
ll len = e - s;
ll b = (len) / (n - 1);
ll lst = s, mx = 0;
ll en = e;
for (ll i = s; i <= en; i += b) {
MinMax(i, min(i + b - 1, en), &s, &e);
if (s == -1) continue;
if (s != -1) {
mx = max(mx, s - lst);
}
lst = e;
}
return mx;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |