# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954765 | Itamar | 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"
using namespace std;
#define ll long long
#include <vector>
#define vll vector<ll>
#include <algorithm>
long long findGap(int T, int N)
{
if (T == 1) {
ll a = -1, b = 1e18 + 1;
vll v;
for (int it = 0; it < (N + 1) / 2; it++) {
auto *at = new ll, *bt = new ll;
MinMax(a + 1, b - 1, at, bt);
a = *at, b = *bt;
v.push_back(a); if(a!=b)v.push_back(b);
}
sort(v.begin(), v.end());
ll ans = 0;
for (int i = 0; i < v.size() - 1; i++)ans = max(ans, v[i + 1] - v[i]);
return ans;
}
else {
auto* a = new ll, * b = new ll;
MinMax(0, 1e18, a, b);
vll v;
ll d = ((* b) - (* a) + N - 2) / (N - 1);
for (int i = *a; i < *b; i += d + 1) {
auto *c = new ll, * k = new ll;
MinMax(i, i+d, c, k);
v.push_back((ll)*c); v.push_back((ll) * k);
}
/*sort(v.begin(), v.end());
ll ans = d;
for (int i = 0; i+1 < v.size(); i++) {
if (v[i] > -1) {
ans = max(ans, v[i + 1] - v[i]);
}
}*/
return ans;
}
}