Submission #274759

#TimeUsernameProblemLanguageResultExecution timeMemory
274759test2Gap (APIO16_gap)C++14
0 / 100
82 ms5880 KiB
#include <bits/stdc++.h> #include <stdlib.h> #include "gap.h" #define I inline void using ll = long long ; using ld = long double ; using namespace std ; long long findGap(int T, int N) { ll lo = 0, hi = 1e18 ; multiset<ll> s ; while(lo <= hi){ ll mn ,mx ; MinMax(lo , hi , &mn , &mx) ; if( (mn) != -1){ s.insert( mn ) ; s.insert( mx ) ; } if( mn == mx ){ break ; } lo = mn+ 1; hi = mx - 1; } ll ans = 0 ; ll l = -1 ; for(auto u : s){ if(l>=0){ ans = max(ans , u - l) ; } l = u ; } return ans ; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...