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 <algorithm>
#include <cmath>
using namespace std;
long long findGap(int T, int N)
{
long long ans = 0;
long long a = pow(10,18);
long long int s, t;
long long int mn;
long long int mx;
MinMax(0,a,&mn,&mx);
long long mini = mn;
long long maxi = mx;
s = mini+1;
t = maxi-1;
while(t>=s) {
MinMax(s,t,&mn,&mx);
if(mn==-1 and mx==-1) { ans = max(ans, maxi-mini); break; }
ans = max(ans, mn - mini);
ans = max(ans, maxi - mx);
if(mn==mx) break;
mini = mn;
maxi = mx;
s = mini+1;
t = maxi-1;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |