제출 #956188

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
956188		thinknoexit	Gap (APIO16_gap)	C++17	30 / 100	36 ms	2164 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
ll a[100100];
int n;
ll ans = 1;
void play(ll l, ll r) {
	if (r - l <= ans) return;
	ll mid = (l + r) / 2;
	ll ql = -1, qr = -1, _l = -1, _r = -1;
	if (l + 1 <= mid) MinMax(l + 1, mid, &_l, &ql);
	if (mid + 1 <= r - 1) MinMax(mid + 1, r - 1, &qr, &_r);
	if (ql == -1 && qr == -1) return;
	if (ql == -1) {
		ans = max(ans, r - _r);
		return play(qr, _r);
	}
	if (qr == -1) {
		ans = max(ans, _l - l);
		return play(_l, ql);
	}
	if (ql != -1 && qr != -1) {
		ans = max(ans, r - _r);
		ans = max(ans, _l - l);
		ans = max(ans, qr - ql);
		play(_l, ql), play(qr, _r);
	}
}
ll findGap(int T, int N) {
	n = N;
	if (T == 1) {
		a[0] = -1, a[n + 1] = inf + 1;
		for (int i = 1;i <= n / 2;i++) {
			MinMax(a[i - 1] + 1, a[n - i + 2] - 1, &a[i], &a[n - i + 1]);
		}
		if (n & 1) {
			ll _;
			MinMax(a[n / 2] + 1, a[n / 2 + 2] - 1, &a[n / 2 + 1], &_);
		}
		for (int i = 1;i < n;i++) {
			ans = max(ans, a[i + 1] - a[i]);
		}
		return ans;
	}
	ll mn, mx;
	MinMax(0, inf, &mn, &mx);
	play(mn, mx);
	return ans;
}

• Subtask 1: 30 / 30
• Subtask 2: 0 / 70