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;
#define ll long long
const ll inf = 2e18;
ll findGap(int T, int N) {
ll L, R;
MinMax(0,inf,&L,&R);
ll all = R-L-1;
ll sz = all/(N-1);
ll last = L;
ll ans = 0;
for(ll x=L+1;x<R;x+=sz) {
ll t1, t2;
MinMax(x,min(R-1,x+sz),&t1,&t2);
if(t1==-1) continue;
ans = max(ans, t1-last);
last = t2;
}
ans = max(ans, R-last);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |