Submission #793229

#	Time	Username	Problem	Language	Result	Execution time	Memory
793229		ToniB	Gap (APIO16_gap)	C++17	42.88 / 100	233 ms	2360 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 2;
const int K = 2;
vector<ll> ans;

ll f(ll L, ll R, ll nums){
	return L + (R - L) / K;
}

void solve(ll L, ll R){
	if(L > R) return ;
	ll d = f(L, R, 0);
	ll val_l = L, val_r = d;
	MinMax(val_l, val_r, &val_l, &val_r);
	if(val_l != -1){
		ans.push_back(val_l);
		if(val_r != val_l){
			ans.push_back(val_r);
			solve(val_l + 1, val_r - 1);
		}
	}
	solve(d + 1, R);
}

ll findGap(int t, int n){
	if(t == 1){
		int L = 0, R = n - 1;
		ll val_l = 1, val_r = 1e18;
		while(L <= R){
			MinMax(val_l, val_r, &val_l, &val_r);
			ans.push_back(val_l);
			if(val_r != val_l) ans.push_back(val_r);
			++L; --R;
			++val_l; --val_r;
		}
	} else {
		solve(1, 1e18);
	}

	ll ret = 0;
	sort(ans.begin(), ans.end());
	for(int i = 0; i < (int)ans.size() - 1; ++i) ret = max(ret, ans[i + 1] - ans[i]);
	return ret;
}

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