제출 #21931

#제출 시각아이디문제언어결과실행 시간메모리
21931RezwanArefin01Gap (APIO16_gap)C++14
30 / 100
73 ms5144 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std; 
typedef long long ll;

long long findGap(int T, int N) {
	if(T==1) {
		ll pmn, pmx, mn, mx, ret = 0; 
		MinMax(0, (ll)1e18+10, &pmn, &pmx);
		for(int i=1; i<(N+1)/2; i++) {
			MinMax(pmn+1, pmx-1, &mn, &mx);
			ret = max(ret, mn - pmn);
			ret = max(ret, pmx - mx);
			pmn = mn, pmx = mx;
		} ret = max(ret, pmx - pmn);
		return ret;
	} else {
		ll st, ed, ret = 0;
		MinMax(0, (ll)1e18+10, &st, &ed);
		ll gap = (ed - st + 1) / (N - 1);
		ll i = st+1, prev = st;
		for(int block=0; block<N-1; block++) {
			ll j = i + gap - 1;
			if(block < gap % (N-1)) j++;
			ll mn, mx; 
			MinMax(i, j, &mn, &mx);
			if(mn != -1) {
				ret = max(ret, mn - prev);
				prev = mx;
			} i = j + 1;
		} 
		return max(ret, ed - prev);
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...