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"
#define ll long long
#include <bits/stdc++.h>
const ll INF = 1e18;
using namespace std;
long long findGap(int T, int N) {
ll A, B;
MinMax(0, INF, &A, &B);
ll dif = (B - A) / (N - 1);
ll cur = A, ans = dif;
while(cur < B) {
ll s, t, mn, mx;
s = t = cur + 1;
do {
t += dif;
if(t > B) {
break;
}
MinMax(s, t, &mn, &mx);
if(mx == -1) {
continue;
}
else {
break;
}
}while(1);
if(t > B) {
t = min(t, B);
MinMax(t - dif, t, &mn, &mx);
}
ans = max(ans, mn - cur);
cur = mx;
//cerr << cur << " ";
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |