제출 #554233

#제출 시각아이디문제언어결과실행 시간메모리
554233GurbanGap (APIO16_gap)C++17
0 / 100
34 ms1092 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,ans = 1; while(now < sag){ ll nwa,nwb; for(ll i = 1;i < 61;i++){ MinMax(now + 1,now + ans * (1ll<<i),&nwa,&nwb); if(nwa != -1){ ans = max(nwa - now,ans); now = nwb; break; } } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...