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<bits/stdc++.h>
#include "gap.h"
//#include "grader.h"
using namespace std;
typedef long long ll;
long long findGap(int T, int N)
{
ll t,s; ll mn=0;
ll mx=1e18;
s=mn; t=mx;
ll a[N];
int f=1;int en=N;
while(mn<mx){
if(f>=en){break;}
MinMax( s, t, &mn, &mx);
a[f]=mn;
a[en]=mx;
s=mn+1;
t=mx-1;
f++;en--;
}
ll ans=1;
for(int i=1;i<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... |