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>
#define forf(i,a,b) for(int i = a; i<=b; i++)
using namespace std;
typedef long long ll;
long long findGap(int T, int N)
{
ll mn=0; ll mx=1e18;
ll ans = 0;
forf(i,1,(N+1)/2){
ll tmn=mn, tmx=mx;
MinMax(tmn+1,tmx-1,&mn,&mx);
if(i!=1) {
ans = max(ans, mn - tmn);
ans = max(ans, tmx - mx);
}
}
ans = max(ans,mx-mn);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |