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 <iostream>
using namespace std;
long long findGap(int T, int N)
{
if (N == 0)return 0;
long long ans = 0;
long long inf = 1e18 + 1;
long long* fi=new long long(1);
long long* se=new long long(1);
MinMax(-1, inf, fi, se);
long long st = *fi;
while (true) {
MinMax(st + 1, inf, fi, se);
if (*fi == -1)break;
if (*fi - st > ans)ans = *fi - st;
st = *fi;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |