제출 #953932

#제출 시각아이디문제언어결과실행 시간메모리
9539324QT0RGap (APIO16_gap)C++17
0 / 100
33 ms3112 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=0,x,y;
	while(P-L>=max(d,(ll)2)){
		MinMax(L+1,P-1,&x,&y);
		if (x==-1){
			ans=max(ans,P-L);
			break;
		}
		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...