Submission #1084437

#TimeUsernameProblemLanguageResultExecution timeMemory
1084437MMihalevGap (APIO16_gap)C++17
0 / 100
34 ms1240 KiB
#include<iostream> #include<algorithm> #include "gap.h" using namespace std; long long l=-10,r=1000000000000000010; long long mn,mx; int rem; long long ans=1LL; long long findGap(int T, int N) { rem=N; while(rem>0) { MinMax(l+1,r-1,&mn,&mx); if(rem==2 && T==1)ans=max(ans,mx-mn); if(l<-1 && T==1) { ans=max(ans,mn-l); ans=max(ans,r-mx); } if(mn!=mx)rem-=2; else rem--; l=mn; r=mx; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...