| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 246008 | wwdd | 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 <stdio.h>
#include <stdlib.h>
#include "gap.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;
}
#include <vector>
using ll = long long;
using vl = std::vector<ll>;
using namespace std;
ll lol(ll n) {
vl wa,wb;
ll lo = 0,hi = 1e18;
ll ok = (n+1)/2;
for(int i=0;i<ok;i++) {
ll ma,mi;
MinMax(lo,hi,&mi,&ma);
lo = mi+1;hi = ma-1;
wa.push_back(mi);
wb.push_back(ma);
}
if(n&1) {wa.pop_back();}
for(int i=wb.size()-1;i>=0;i--) {wa.push_back(wb[i]);}
ll res = 0;
for(int i=1;i<n;i++) {
res = max(res,wa[i]-wa[i-1]);
}
return res;
}
ll solve(ll n) {
ll lo = 0,hi = 1e18;
ll st,ed;
MinMax(lo,hi,&st,&ed);
ll bd = (ed-st+n-2)/(n-1);
vl w;
w.push_back(st);
lo = st+1;
for(int i=0;i<n-1;i++) {
if(lo > ed) {break;}
hi = min(lo+bd,ed);
ll sa,sb;
MinMax(lo,hi,&sa,&sb);
if(sa != -1) {
w.push_back(sa);
w.push_back(sb);
}
lo = hi+1;
}
w.push_back(ed);
ll res = 0;
for(int i=1;i<w.size();i++) {
res = max(res,w[i]-w[i-1]);
}
return res;
}
long long findGap(int T, int N) {
if(T == 1) {
return lol(N);
} else {
return solve(N);
}
}
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);
}