Submission #1091862

#	Time	Username	Problem	Language	Result	Execution time	Memory
1091862		lovrot	Gap (APIO16_gap)	C++17	100 / 100	45 ms	9012 KiB

gap

#include "gap.h"
#include <cstdio>
#include <algorithm>

#define X first
#define Y second
#define PB push_back
#define debug(...) fprintf(stderr, __VA_ARGS__)

using namespace std; 

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll OO = 1e18;
const int N = 5e5 + 10;

int cnt = 0;

pll query(ll a, ll b) { 
	if(a > b) { return {-1, -1}; }
	ll ret, ret_;
	++cnt;
	MinMax(a, b, &ret, &ret_);
	return {ret, ret_};
}

ll solve(ll lst, ll l, ll r, int n) { 
	if(n == 1) { return 0; }
	pll res = query(l, l + (r - l) / (n - 1)); 
	return max(res.X - lst, solve(max(lst, res.Y), l + (r - l) / (n - 1) + 1, r, n - 1));
}

ll niz[N];

ll findGap(int T, int n) {
	if(T == 1) { 
		int minp = 0;
		int maxp = n - 1;
		ll mn = 0, minr;
		ll mx = OO, maxr;
	 
		while(minp <= maxp){ 
			MinMax(mn, mx, &minr, &maxr);
			niz[minp] = minr;
			niz[maxp] = maxr;
			mn = minr + 1;
			mx = maxr - 1; 
			minp++;
			maxp--;
		}
	 
		ll ans = 0;
		for(int i = 0; i < n - 1; i++) ans = max(ans, niz[i + 1] - niz[i]);
		return ans; cnt = 0;
	}
	pll res = query(0, OO);
	ll ret = solve(res.X, res.X + 1, res.Y, n);
	return ret;
}

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