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"
using namespace std;
long long findGap(int T, int N)
{
long long res = 0;
if(T == 1)
{
long long s, t;
long long mn;
long long mx;
s = 0;
t = 1000000000000000000LL;
MinMax(s, t, &mn, &mx);
s = mn+1;
t = mx-1;
while(1)
{
MinMax(s, t, &mn, &mx);
if(mn == -1)
{
if(s - t - 2 > res) res = s - t - 2;
return res;
}
if(s - mn > res) res = s - mn;
if(mx - t > res) res = mx - t;
s = mn+1;
t = mx-1;
}
}
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |