Submission #1196095

#TimeUsernameProblemLanguageResultExecution timeMemory
1196095hackstarGap (APIO16_gap)C++20
30 / 100
2096 ms1984 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; #define int long long int findGap(signed t,signed n){ if(t==1){ vector<int>a(n); int l=0,r=1e18; int mn,mx; for(int i=0;i<(n+1)/2;i++){ MinMax(l,r,&mn,&mx); a[i]=mn; a[n-i-1]=mx; l=mn+1; r=mx-1; } int ans=0; for(int i=0;i<n-1;i++){ int cur=a[i+1]-a[i]; ans=max(ans,cur); } return ans; } int l=0,r=1e18; int mn,mx; MinMax(l,r,&mn,&mx); int ans=(mx-mn)/(n-1); int lst=mn; while(l<r){ MinMax(l,l+ans-1,&mn,&mx); l+=ans; ans=max(ans,mn-lst); if(~mx){ lst=mx; } } return max(ans,r-lst); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...