Submission #38748

#TimeUsernameProblemLanguageResultExecution timeMemory
38748oTTo_22Gap (APIO16_gap)C++14
0 / 100
2000 ms524288 KiB
#include <bits/stdc++.h> #include "gap.h" #define se second #define fi first using namespace std; long long ans=0; void func (long long L,long long R) { long long mi1,ma1,mi2,ma2; long long mid=(L+R)/2; MinMax(L,mid,&mi1,&ma1); MinMax(mid,R,&mi2,&ma2); if (ma1==-1 && mi2==-1) { ans=max(ans,R-L); return; } if (ma1==-1) { ans=max(ans,mi2-L); return; } if (mi2==-1) { ans=max(ans,R-ma1); return; } if (ma1-L>ans) func(L,ma1); if (R-mi2>ans) func(mi2,R); } long long findGap(int T, int N) { int n=N; long long Mn,Mx; long long S=0; long long TT=1000000000000000000; MinMax(S,TT,&Mn,&Mx); if (n==2) return Mx-Mn; ans=0; func (Mn,Mx); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...