Submission #553209

#TimeUsernameProblemLanguageResultExecution timeMemory
553209GurbanGap (APIO16_gap)C++17
12.65 / 100
50 ms1084 KiB
#include "bits/stdc++.h" #include "gap.h" using namespace std; using ll = long long; long long findGap(int T, int N) { ll cep,sag; MinMax(1,(ll)1e18,&cep,&sag); assert(cep != -1 && sag != -1); ll now = cep + 1,ans = 0; while(now < sag){ for(ll i = 0;i < 61;i++){ ll nwa,nwb; MinMax(now,now + ans + (1ll << i) - 1,&nwa,&nwb); if(nwa != -1){ ans = max(ans,nwa - now + 1); now = nwb + 1; break; } } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...