# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
400595 | A_D | 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 ll long long
using namespace std;
ll l2=0,r2=1e18;
ll *l1=&l2;
ll *r1=&r2;
ll s(ll m)
{
vector<ll> vec;
ll l=0,r=1e18;
l2=0,r2=1e18;
while(l<=r&&m--){
MinMax(l,r,l1,r1);
if(l2!=-1)vec.push_back(l2);
if(r2!=-1)vec.push_back(r2);
l=l2;
r=r2;
l++;
r--;
}
sort(vec.begin(),vec.end());
ll ans=1;
for(ll i=1;i<vec.size();i++)ans=max(ans,vec[i]-vec[i-1]);
return ans;
}
vector <ll> vec;
set <ll> st
int n;
void bs(int l,int r)
{
if(l>r||n==0)return;
int mid=(l+r)/2;
MinMax(l,r,l1,r1);
if(l2==-1){
bs(mid+1,r);
}
else if(l2==r2){
vec.push_back(l2);
n--;
st.insert(l2);
bs(mid+1,r);
}
else{
n-=2;
vec.push_back(l2);
vec.push_back(r2);
bs(l2+1,r2-1);
bs(mid+1,r);
}
}
ll s2()
{
st.clear();vec.clear();
bs(0,1e18);
ll ans=1;
sort(vec.begin(),vec.end());
for(ll i=1;i<vec.size();i++)ans=max(ans,vec[i]-vec[i-1]);
return ans;
}
long long findGap(int T, int N)
{
n=N;
if(T==1)return s((N+1)/2);
else{
return s2();
}
}