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 x = 0 , y = 1e18 ,mn , mx , ans = 0;
if(T == 1){
MinMax(x , y , &mn , &mx);
x = mn , y = mx;
for(int i = 1; i < (n + 1) /2; ++i){
MinMax(x+1 , y-1 , &mn , &mx);
ans = max({ans, y - mx , mn - x});
x = mn , y =mx;
}
return max(ans , mx-mn);
}
//1 2 3 4 5 6
MinMax(0 , 1e18 , &mn , &mx);
ll sz = ans = (mx- mn) / (n - 1);
x = mn , y = mx;
//1 4 6 30
ll lst = 1e18;
for(ll i = x; i <= y; i += sz){
MinMax(i+1 , i + sz+1 , &mn , &mx);
if(mn == -1)continue;
ans = max(ans , mn - lst);
lst = mx;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |