| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 338973 | ogibogi2004 | 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<bits/stdc++.h>
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;
long long findGap(int, int);
void MinMax(long long s, long long t, long long *mn, long long *mx)
{
cout<<s<<" "<<t<<endl;
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)
{
long long l,r,n=N;
if(T==1)
{
MinMax(0ll,(long long)1e18,&l,&r);
vector<long long> numbers;
numbers.push_back(l);
numbers.push_back(r);
//cout<<l<<" "<<r<<endl;
for(int j=1;j<(n+1)/2;j++)
{
MinMax(l+1,r-1,&l,&r);
if(l==-1)break;
numbers.push_back(l);
numbers.push_back(r);
//cout<<"??\n";
}
sort(numbers.begin(),numbers.end());
long long ans=0;
for(long long i=1;i<numbers.size();i++)
{
ans=max(ans,numbers[i]-numbers[i-1]);
}
return ans;
}
if(T==2)
{
MinMax(0ll,(long long)1e18,&l,&r);
long long bucket_size=max(2ll,(r-l)/(n-1)),l1=l+1,r1=r-1;
vector<long long>numbers;
for(long long i=0;i*bucket_size+l1<=r1;i++)
{
long long xd1,xd2;
MinMax(i*bucket_size+l1,(i+1)*bucket_size+l1-1,&xd1,&xd2);
if(xd1!=-1)numbers.push_back(xd1);
if(xd2!=-1)numbers.push_back(xd2);
}
long long ans=0;
for(long long i=1;i<numbers.size();i++)
{
ans=max(ans,numbers[i]-numbers[i-1]);
}
return ans;
}
}
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);
}