# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341773 | blue | Gap (APIO16_gap) | C++11 | 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"
using namespace std;
long long findGap(int T, int N)
{
if(T == 1)
{
long long s, t;
long long& mn;
long long& mx;
s = 0;
t = 1000000000000000000LL;
long long res = 0;
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 -1;
}