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;
typedef long long ll;
long long findGap(int T, int n){
ll mn,mx;
MinMax(1,1e18,&mn,&mx);
ll ans=(mx-mn)/(n-1);
for(ll l=mn,r=mx,p=mn;l+1<r;l+=ans+1){
MinMax(l+1,min(l+ans+1,r),&mn,&mx);
if(mn!=-1)ans=max(ans,mn-p),p=mx;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |