Submission #404722

#	Time	Username	Problem	Language	Result	Execution time	Memory
404722		BERNARB01	Gap (APIO16_gap)	C++17	30 / 100	72 ms	2232 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>

using namespace std;

long long findGap(int T, int N) {
	vector<long long> a;
	if (T == 1) {
		long long lb = 0, rb = (long long) 1e18L;
		a.resize(N);
		for (int i = 0; i < (N + 1) / 2; i++) {
			MinMax(lb, rb, &a[i], &a[N - 1 - i]);
			lb = a[i] + 1;
			rb = a[N - 1 - i] - 1;
		}
		long long ans = 0;
		for (int i = 1; i < N; i++) {
			ans = max(ans, a[i] - a[i - 1]);
		}
		return ans;
	}
	long long mn, mx;
	MinMax(0, 1e18L, &mn, &mx);
	if (N == 2) {
		return mx - mn;
	}
	long long len = (mx - mn - 1) / (N - 1);
	long long ans = len;
	a.push_back(mn);
	for (int i = 0; i < N - 1; i++) {
		long long m, M;
		if (mn + 1 == mx - 1) {
			a.push_back(mn + 1);
			break;
		}
		MinMax(mn + 1, min(mn + 1 + len, mx - 1), &m, &M);
		mn = mn + 1 + len;
		if (m == -1) {
			continue;
		}
		a.push_back(m);
		if (M != m) {
			a.push_back(M);
		}
	}
	a.push_back(mx);
	for (int i = 1; i < (int) a.size(); i++) {
		ans = max(ans, a[i] - a[i - 1]);
	}
	return ans;
}

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