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 f,l;
MinMax(0,1e18,&f,&l);
long long p=f+1,g=1;
while (p<=l)
{
long long mn=-1,mx=-1,tmp=g;
while (mn==-1)
{
tmp*=2;
MinMax(p,p+tmp-1,&mn,&mx);
}
g=max(g,mn-p+1);
p=mx+1;
}
return g;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |