# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
284893 | triplem5ds | Gap (APIO16_gap) | C++14 | 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;
long long findGap(int T, int N)
{
long long ans = 0;
long long mn, mx;
if(T == 1){
vector<long long> L, R;
long long LO = 0, HI = 1000000000000000000;
while(L.size() + R.size() < N){
MinMax(LO,HI, & mn, & mx);
L.push_back(*mn);
R.push_back(*mx);
LO = mn + 1;
HI = mx - 1;
}
reverse(R.begin(),R.end());
if(N & 1)
L.pop_back();
vector<long long> v;
for(auto x : L)v.push_back(x);
for(auto x : R)v.push_back(x);
for(int i = 1; i < v.size(); i++)
ans = max(ans, v[i] - v[i-1]);
} else {
MinMax(0, 1000000000000000000, mn, mx);
long long d = (mx - mn + N - 3) / (N - 1);
vector<long long> v({mn, mx});
long long cur = mn + 1;
while(cur < v[1]) {
MinMax(cur, min(v[1] - 1, cur + d - 1), &mn, &mx);
cur += d;
if(mn == -1)continue;
v.push_back(mn);
v.push_back(mx);
}
sort(v.begin(),v.end());
for(int i = 1; i < v.size(); i++)
ans = max(ans, v[i] - v[i-1]);
}
return ans;
}