# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338679 | NicolaAbusaad2014 | 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.
/**
* Prof.Nicola
**/
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
template<class T>void re(T&x){cin>>x;}
template<class T1,class T2> void re(pair<T1,T2>&x){re(x.first);re(x.second);}
template<class T>void re(vector<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}}
template<class T>void re(deque<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}}
template<class T1,class T2> pair<T1,T2> mp(T1&x,T2&z){return make_pair(x,z);}
long long n;
set<long long>s;
set<long long>::iterator a,b;
void solve(long long l,long long r)
{
long long mx,mn;
MinMax(l, r, &mn, &mx);
if(mn==-1){
return;
}
s.insert(mn);
s.insert(mx);
if(s.size()==n){
return;
}
if(mn+1>=mx){
return;
}
if(mn+3>=mx){
solve(mn+1,mx-1);
return;
}
solve(mn+1,((mx+mn)/2));
if(s.size()==n){
return;
}
solve(((mx+mn)/2)+1,mx-1);
return;
}
long long findGap(int T, int N)
{
n=N;
if(T==1){
long long l=0,r=1e18,mn,mx;
while(s.size()<N){
MinMax(l,r,&mn,&mx);
l=mn+1;
r=mx-1;
s.insert(mn);
s.insert(mx);
}
a=s.begin();
b=s.begin();
b++;
long long ans=0;
for(long i=1;i<s.size();i++){
ans=max(ans,(*b)-(*a));
a++;
b++;
}
}
else{
long long l=0,r=1e18;
solve(l,r);
a=s.begin();
b=s.begin();
b++;
long long ans=0;
for(long i=1;i<s.size();i++){
ans=max(ans,(*b)-(*a));
a++;
b++;
}
}
return ans;
}