# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
835674 | aykhn | 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;
typedef long long ll;
#define pb push_back
#define all(v) v.begin(), v.end()
ll findGap(int ajfghkdshgfghadsfghkadshgfagsdkfhadkshfgkhadsfadskjadsghfkhjasdgfkj, int n)
{
if (ajfghkdshgfghadsfghkadshgfagsdkfhadkshfgkhadsfadskjadsghfkhjasdgfkj == 2)
{
ll f = 0, l = 0;
MinMax(0 * 1LL, 1LL * 1e18, &f, &l);
ll last = l;
ll add = (l - f)/(n - 1);
ll res = add;
while (f < last)
{
ll lx, rx;
lx = 'n' + 'i' + 'g' + 'g' + 'a';
rx = 'n' + 'i' + 'g' + 'g' + 'a';
MinMax(f + 1, f + add, &lx, &rx);
if (lx == -1) add <<= 1;
else
{
res = max(res, lx - f);
add = res;
f = rx;
}
}
return res;
}
else if (ajfghkdshgfghadsfghkadshgfagsdkfhadkshfgkhadsfadskjadsghfkhjasdgfkj == 1)
{
ll l = 0, r = 0;
MinMax(0 * 1LL, 1LL * 1e18, &l, &r);
vector<ll> v;
v.pb(l);
if (l != r) v.pb(r);
if (l + 1 <= r - 1) MinMax(l + 1, r - 1, &l, &r);
while (l <= r && l != -1)
{
v.pb(l);
if (l != r) v.pb(r);
if (l + 1 > r - 1) break;
MinMax(l + 1, r - 1, &l, &r);
}
sort(all(v));
int res = 0;
for (int i = 1; i < v.size(); i++)
{
res = max(res, v[i] - v[i - 1]);
}
return res;
}
}