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"
#define ll long long
using namespace std;
ll findGap(int T , int n){
ll ANS = 0;
if(T==1){
ll x =0, y = 1e18;
for(int i = 1; i<= (n + 1) /2; ++i){
ll mn , mx;
MinMax(x , 1e18 , &mn , &mx);
if(x)ANS = max(ANS , mn - x+1);
MinMax(0 , y , &mn , &mx);
if(y != 1e18)ANS = max(ANS , y - mx+1);
x = mn + 1;
y = mx - 1;
}
}
return ANS;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |