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;
long long MX=1000000000000000000;
long long findGap(int T, int N)
{
long long mn,mx,pas=1,mn1,mx1,xr=1;
MinMax(0,MX,&mn,&mx);
if(T==1){
for(int i=1;i<(N+1)/2;i++){
MinMax(mn+1,mx-1,&mn1,&mx1);
if(mn1==-1) break;
pas=max(pas,max(mn1-mn,mx-mx1));
mx=mx1;
mn=mn1;
}
return max(pas,mx-mn);
}
while(1){
if(mn>=mx) break;
MinMax(mn+1,mn+1+xr,&mn1,&mx1);
if(mn1==-1) {xr*=2;continue;}
pas=max(pas,mn1-mn);
mn=mn1;
}
return pas;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |