제출 #554239

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