# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
507530 | keta_tsimakuridze | 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>
#define int long long
using namespace std;
/*
static void my_assert(int k){ if (!k) exit(1); }
static int subtask_num, N;
static long long A[100001];
static long long call_count;
void MinMax(long long s, long long t, long long *mn, long long *mx)
{
int lo = 1, hi = N, left = N+1, right = 0;
my_assert(s <= t && mn != NULL && mx != NULL);
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] >= s) hi = mid - 1, left = mid;
else lo = mid + 1;
}
lo = 1, hi = N;
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] <= t) lo = mid + 1, right = mid;
else hi = mid - 1;
}
if (left > right) *mn = *mx = -1;
else{
*mn = A[left];
*mx = A[right];
}
if (subtask_num == 1) call_count++;
else if (subtask_num == 2) call_count += right-left+2;
}*/
long long findGap(int T, int n)
{
int L = 0, R = 1e18;
if(T == 1) {
vector<int> p, s;
while(L <= R) {
int mn = 0, mx = 0;
MinMax(L, R, &mn, &mx);
if(mn == -1) break;
p.push_back(mn); s.push_back(mx);
L = mn + 1; R = mx - 1;
}
for(int j = (int)s.size() - 1; j >= 0; j--) p.push_back(s[j]);
int ans = 0;
for(int j = 1; j < p.size(); j++) ans = max(ans, p[j] - p[j - 1]);
return ans;
}
int mn = 0, mx = 0, Mx = 0;
MinMax(L, R, &mn, &mx); Mx = mx;
int x = (mx - mn + n - 1) / n, ans = x;
int last = mn, cur = mn + 1;
while(cur <= Mx) {
MinMax(cur, cur + x, &mn, &mx);
ans = max(ans, mn - last);
if(mx != -1) last = mx;
cur += x + 1;
}
return ans;
}
/*
main()
{
FILE *in = stdin, *out = stdout;
my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
my_assert(1 <= subtask_num && subtask_num <= 2);
my_assert(2 <= N && N <= 100000);
for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
fprintf(out, "%lld\n", findGap(subtask_num, N));
fprintf(out, "%lld\n", call_count);
}
*/