# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
240166 | b00n0rp | Gap (APIO16_gap) | C++17 | 0 ms | 0 KiB |
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;
#define int long long
int findGap(int T,int N){
if(T == 1){
int l = 0,r = (int)(1e18);
vector<int> v;
while(v.size() < N){
int mn,mx;
MinMax(l,r,&mn,&mx);
v.push_back(mn);
if(mn != mx) v.push_back(mx);
l = mn+1;
r = mx-1;
}
sort(v.begin(),v.end());
int ans = 0;
for(int i = 1; i < v.size(); i ++){
ans = max(ans,v[i]-v[i-1]);
}
return ans;
}
else{
int l = 0,r = (int)(1e18);
int mn,mx;
MinMax(l,r,&mn,&mx);
int mans = (mx-mn+N-2)/(N-1);
vector<int> v;
v.push_back(mn);
v.push_back(mx);
l = mn+1;
r = mx-1;
while(l < r){
MinMax(l,min(l+mans-1,r),&mn,&mx);
l += mans;
if(mn != -1) v.push_back(mn);
if(mx != -1) v.push_back(mx);
}
sort(v.begin(),v.end());
int ans = 0;
for(int i = 1; i < v.size(); i ++){
ans = max(ans,v[i]-v[i-1]);
}
return ans;
}
}