Submission #1257225

#TimeUsernameProblemLanguageResultExecution timeMemory
1257225MasterDebaterGap (APIO16_gap)C++20
100 / 100
44 ms1864 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; #define ll long long const int N=1e5+10; const ll MAXN=1e18; ll ans,a[N]; ll findGap(int T,int N){ if(T==1){ ll li=1,ri=N; a[N+1]=MAXN+1; a[0]=-1; while(ri-li>=0){ MinMax(a[li-1]+1,a[ri+1]-1,&a[li],&a[ri]); li++,ri--; } sort(a,a+N); for(int i=1;i<N;i++)ans=max(ans,a[i+1]-a[i]); } else{ ll mn,mx; MinMax(1,MAXN,&mn,&mx); ll x=(mx-mn+N-2)/(N-1); ans=x; ll l,r,p=mn,i; for(i=mn;i+x<mx;i+=x+1){ MinMax(i,i+x,&l,&r); if(l!=-1)ans=max(ans,l-p),p=r; } MinMax(i,mx,&l,&r); if(l!=-1)ans=max(ans,l-p); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...