Submission #1164864

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164864		KickingKun	Gap (APIO16_gap)	C++20	30 / 100	2097 ms	2668 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long

vector <ll> res;
int dnc(ll l, ll r, ll need) {
	need = min(need, r - l + 1);
	if (need <= 0) return {};
	if (need <= 2) {
		ll x, y; MinMax(l, r, &x, &y);
		int cnt = 0;
		if (x != -1) res.emplace_back(x), ++cnt;
		if (x < y) res.emplace_back(y), ++cnt;
		return cnt;
	}
	
	ll mid = (l + r) >> 1;
	int sizeL = dnc(l, mid, need);
	int sizeR = dnc(mid + 1, r, need - sizeL);
	return sizeL + sizeR;
}

ll findGap(int T, int N) {
	if (T == 1) {
		vector <ll> A, B;
		ll l = 0, r = 1e18;
		while (l <= r && A.size() + B.size() < N) {
			ll x, y; MinMax(l, r, &x, &y);
			if (x == -1) break;
			A.emplace_back(x);
			if (x < y) B.emplace_back(y);
			l = x + 1, r = y - 1;
		}
		for (int i = B.size() - 1; i > -1; i--)
			A.emplace_back(B[i]);
		
		ll ans = 0;
		for (int i = 1; i < A.size(); i++)
			ans = max(ans, A[i] - A[i - 1]);
		return ans;
	}
	
	else {
		dnc(0, 1e18, N); // sort (res.begin(), res.end());
		ll ans = 0;
		for (int i = 1; i < N; i++)
			ans = max(ans, res[i] - res[i - 1]);
		return ans;
	}
}

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