# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338951 | 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<bits/stdc++.h>
#include "gap.h"
using namespace std;
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);
for(;;)
{
MinMax(l+1,r-1,&l,&r);
if(l==-1)break;
numbers.push_back(l);
numbers.push_back(r);
}
sort(numbers.begin(),numers.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);
vector<long long>numbers;
for(long long i=0;i*bucket_size+l<=r;i++)
{
long long xd1,xd2;
MinMax(i*bucket_size+l,(i+1)*bucket_size+l-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;
}
}