제출 #856635

#제출 시각아이디문제언어결과실행 시간메모리
856635ttamxGap (APIO16_gap)C++14
59.04 / 100
42 ms3020 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; long long findGap(int T, int n){ ll mn,mx; MinMax(1,1e18,&mn,&mx); ll d=(mx-mn)/(n-1); ll ans=(mx-mn+n-2)/(n-1); for(ll l=mn,r=mx,p=mn;l+1<r;l+=d){ MinMax(l+1,min(l+d,r),&mn,&mx); if(mn!=-1)ans=max(ans,mn-p),p=mx; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...