| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 554305 | Koosha_mv | 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>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#define int ll
#include "gap.h"
const int N=1e6+99,inf=1e18;
int n;
/*
pair<int,int> get(int l,int r){
int mn,mx;
MinMax(l,r,&mn,&mx);
return {mn,mx};
}*/
ll findGap(int T, int n)
{
vector<ll> V;
if(T == 1){
ll l=1,r=1e18,mn,mx,ans=0;
while(V.size() < n){
MinMax(l,r,&mn,&mx);
V.push_back(mn);
if(mx != mn) V.push_back(mx);
l = mn + 1, r = mx - 1;
}
sort(V.begin(),V.end());
for(int i=1;i<V.size();i++) ans = max(ans,V[i]-V[i-1]);
return ans;
}
}
int32_t main(){
}