# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
832739 | tolbi | Gap (APIO16_gap) | C++17 | 0 ms | 0 KiB |
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 = 1, r = 1e18-1;
long long ans = 0;
while (l<r){
long long newl, newr;
MinMax(l,r,newl,newr);
ans=max(ans,newl-l+1);
l=newl+1;
ans=max(ans,r-newr+1);
r=newr-1;
}
return ans;
}