제출 #953927

#제출 시각아이디문제언어결과실행 시간메모리
9539274QT0RGap (APIO16_gap)C++17
0 / 100
3100 ms2860 KiB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
#define ll long long

ll findGap(int T, int n){
	ll L,P;
	MinMax(0,1e18,&L,&P);
	ll d=(P-L)/(n-1);
	ll ans=d,x,y;
	while(P-L>d){
		MinMax(L+1,P-1,&x,&y);
		if (x==-1)ans=max(ans,P-L);
		else{
			ans=max({ans,x-L,P-y});
			L=x;
			P=y;
		}
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...