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 findGap(int T, int N)
{
long long l, r;
MinMax(0,1e18,&l,&r);
l++,r--;
long long ans = 0;
while (l<r){
long long newl, newr;
MinMax(l,r,&newl,&newr);
if (newl==-1) {
ans=max(ans,r-l+2);
break;
}
ans=max(ans,newl-l+1);
l=newl+1;
ans=max(ans,r-newr+1);
r=newr-1;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |