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;
#define vv vector<int>
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
long long findGap(int T, int N)
{
ll l,r;
MinMax(0,1e18,&l,&r);
ll res=0;
while(l+1<=r-1){
ll a,b;
MinMax(l+1, r-1, &a, &b);
if (a==-1)break;
res=max({res, a-l, r-b});
l=a;r=b;
}
res=max(res, r-l);
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |