| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 143144 | alextodoran | 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 <bits/stdc++.h>
#define ll long long
#define N_MAX 100002
using namespace std;
const ll INF = 1000000000000000000;
void MinMax(long long s, long long t, long long *mn, long long *mx);
ll a[N_MAX];
ll mi, mx;
ll findGap (int t, int n)
{
if(t == 1)
{
a[0] = -1;
a[n + 1] = INF + 1;
int x = 1, y = n;
while(x <= y)
{
MinMax(a[x - 1] + 1, a[y + 1] - 1, &mi, &mx);
a[x] = mi;
a[y] = mx;
x++;
y--;
}
}
else
{
a[0] = -1;
for(int i = 1; i <= n; i++)
{
ll l = a[i - 1] + 1, r = INF;
while(l < r)
{
ll mid = (l + r) / 2;
MinMax(a[i - 1] + 1, mid, &mi, &mx);
if(mi == -1)
l = mid + 1;
else
r = mid;
}
a[i] = l;
}
}
ll ans = 0;
for(int i = 2; i <= n; i++)
ans = max(ans, a[i] - a[i - 1]);
return ans;
}
#include <stdio.h>
#include <stdlib.h>
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;
long long findGap(int, int);
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;
}
int 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);
}