Submission #1297876

#TimeUsernameProblemLanguageResultExecution timeMemory
1297876denislavGap (APIO16_gap)C++20
0 / 100
41 ms3408 KiB
# include <iostream> # include <vector> # include <algorithm> using namespace std; # include "gap.h" //# include "grader.cpp" const long long INF=1e18; long long findGap(int T, int _N) { int n=_N; long long curr,to; MinMax(0,1e18,&curr,&to); long long S=(to-curr+n-2)/(n-1),ans=S; vector<long long> v; while(curr<=to) { long long r=min(curr+S,to),mn,mx; MinMax(curr,r,&mn,&mx); v.push_back(mn);v.push_back(mx); curr=r+1; } int sz=v.size(); for(int i=0;i+1<sz;i++) ans=max(ans,v[i+1]-v[i]); return ans; } /* 2 4 2 3 6 8 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...