Submission #21891

#TimeUsernameProblemLanguageResultExecution timeMemory
21891mohammad_kilaniGap (APIO16_gap)C++14
0 / 100
2000 ms5144 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; map<long long,bool> vis; vector<long long> v; long long findGap(int T, int N) { long long ans = 0 ; long long s,e; MinMax(0,1e18,&s,&e); long long step = (e-s)/(N-1); ans = step; long long mn,mx; for(long long i = s+step;i<=e;){ MinMax(s,i,&mn,&mx); if (mx != s){ s = mx; i = s+step; } else{ MinMax(i,i+1,&mn,&mx); ans = max(ans,(mn-s)); step = ans; i = mn+step; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...