# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145624 | karma | Gap (APIO16_gap) | C++11 | 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<bits/stdc++.h>
#include "gap.h"
#define ll long long
using namespace std;
const ll oo = (ll)1e18;
ll findGap(int T, int N)
{
ll Min, Max, res;
MinMax(0, oo, Min, Max);
vector<ll> v;
if(T == 1) {
ll preMin, preMax;
int i = 1, j = N - 2;
v.emplace_back(Min), v.emplace_back(Max);
while(i <= j) {
MinMax(preMin + 1, preMax - 1, Min, Max);
v.emplace_back(Min); v.emplace_back(Max);
preMin = Min, preMax = Max;
++i, --j;
}
} else {
ll dis = (Max - Min + N - 2) / (N - 1);
for(ll pos = Min + 1; pos < Max; pos += dis) {
MinMax(pos, pos + dis - 1, Min, Max);
if(Min != -1) v.emplace_back(Min), v.emplace_back(Max);
}
}
sort(v.begin(), v.end());
for(int i = 1; i < int(v.size()); ++i) res = max(res, v[i] - v[i - 1]);
return res;
}