Submission #832767

#TimeUsernameProblemLanguageResultExecution timeMemory
832767tolbiGap (APIO16_gap)C++17
30 / 100
36 ms1124 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; long long findGap(int T, int N) { long long l, r; int qu = 0; qu++; //if (qu>(N+1)/2) assert(false); MinMax(0,1e18,&l,&r); l++,r--; long long ans = 0; N-=2; while (l<r){ if (N==0){ ans=max(ans,r-l+2); break; } long long newl, newr; qu++; //if (qu>(N+1)/2) assert(false); MinMax(l,r,&newl,&newr); if (newl==-1) { ans=max(ans,r-l+2); break; } N-=2; ans=max(ans,newl-l+1); l=newl+1; ans=max(ans,r-newr+1); r=newr-1; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...