제출 #378441

#제출 시각아이디문제언어결과실행 시간메모리
378441rainboyGap (APIO16_gap)C11
70 / 100
66 ms1280 KiB
#include "gap.h"

long long max(long long a, long long b) { return a > b ? a : b; }

long long findGap(int t, int n) {
	if (t == 2) {
		long long lower, upper, b, a, a_, l, r, ans;

		MinMax(0, 1000000000000000000, &lower, &upper);
		b = (upper - lower + n - 2) / (n - 1) + 1;
		ans = b - 1, a_ = -1;
		for (a = lower; a <= upper; a += b) {
			MinMax(a, a + b - 1, &l, &r);
			if (a_ == -1)
				a_ = r;
			else if (r != -1)
				ans = max(ans, l - a_), a_ = r;
		}
		return ans;
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...