Submission #956227

#	Time	Username	Problem	Language	Result	Execution time	Memory
956227		thinknoexit	Gap (APIO16_gap)	C++17	30 / 100	51 ms	7552 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
mt19937 rnd(time(NULL));
ll a[100100];
ll Ran(ll l, ll r) {
	return l + (rnd() % (r - l));
}
int n;
ll mx = 1;
void play(ll l, ll r) {
	if (r - l <= mx) return;
	ll mid = Ran(l + 1, r - 1);
	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) ql = l;
	if (qr == -1) qr = r;
	mx = max(mx, qr - ql);
	if (_l != -1) play(_l, ql);
	if (_r != -1) 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++) {
			mx = max(mx, a[i + 1] - a[i]);
		}
		return mx;
	}
	ll l, r;
	MinMax(0, inf, &l, &r);
	play(l, r);
	return mx;
}

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