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;
typedef long long int ll;
long long findGap(int T, int N)
{
ll l = 0,r = 1e18;
vector<ll>a,b;
while(true){
ll mn,mx;
MinMax(l,r,&mn,&mx);
if(mn==-1)break;
if(mn==mx){
a.push_back(mn);
break;
}else{
a.push_back(mn);
b.push_back(mx);
}
l = mn+1;
r = mx-1;
}
reverse(b.begin(),b.end());
for(auto x:b)a.push_back(x);
ll ans = 0;
for(int i=0;i+1<N;i++)ans = max(ans,a[i+1]-a[i]);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |