Submission #45831

#TimeUsernameProblemLanguageResultExecution timeMemory
45831gnoorGap (APIO16_gap)C++17
30 / 100
93 ms39280 KiB
#include "gap.h" #include <cstdio> #ifdef debug #include "grader.cpp" #endif #include <vector> #include <algorithm> using namespace std; long long findGap(int T, int N) { if (T==1) { vector<long long> tbl; long long mn,mx; long long left=0; long long rgt=1e18; int x=(N+1)/2; for (int i=0;i<x;i++) { MinMax(left,rgt,&mn,&mx); tbl.push_back(mn); if (mx!=mn) tbl.push_back(mx); left=mn+1; rgt=mx-1; } sort(tbl.begin(),tbl.end()); long long ans=0; for (int i=1;i<N;i++) { //printf("%lld ",tbl[i]); ans=max(ans,tbl[i]-tbl[i-1]); } //printf("\n"); return ans; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...