Submission #908648

#	Time	Username	Problem	Language	Result	Execution time	Memory
908648		ByeWorld	Gap (APIO16_gap)	C++14	100 / 100	67 ms	7384 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
#define bupol __builtin_popcount
//#define int long long 
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = 1e5+5;
const int MAXK = 205;
const int LOG = 20;
const int MOD = 1e9+7;
const int SQRT = 520;
const ll INF = 1e18;
typedef pair<ll,ll> pii;
typedef pair<ll,pii> ipii;

ll mn, mx;
int n;
set<ll> s; ll ans = -INF;
ll le, ri, nx;
ll x, y;
ll a[MAXN];

long long findGap(int T, int N)
{
	if(T==1){
		n = N;
		x = 0; y = INF;
		for(int i=1; i<=(n+1)/2; i++){
			MinMax(x, y, &mn, &mx);
			a[i] = mn; a[n-i+1] = mx;
			//cout << mn << ' '<< mx << " p\n";
			x = mn+1; y = mx-1;
		}
		for(int i=1; i<=n-1; i++){
			ans = max(ans, a[i+1]-a[i]);
		}
		return ans;
	}
	n = N;
	MinMax(0, INF, &mn, &mx); le = mn; ri = mx;
	s.insert(mn); s.insert(mx);

	ll len = mx-mn-1, idx = mn;
	for(ll i=1; i<=n-2; i++){ // n+1 segment
		nx = len / (n-2) * i + le;
		if(idx+1 <= nx){
			//cout << idx+1 << ' ' << nx << " p\n";
			MinMax(idx+1, nx, &mn, &mx);
			s.insert(mn); s.insert(mx);
		}

		idx = nx;
	}

	nx = ri-1;
	if(idx+1 <= nx){
		//cout << idx+1 << ' ' << nx << " p\n";
		MinMax(idx+1, nx, &mn, &mx);
		s.insert(mn); s.insert(mx);
	}
	//for(auto in : s) cout << in << " xx\n";
	auto it = s.begin(); ll las = -1;
	while(it != s.end()){
		if(las != -1) ans = max(ans, (*it)-las);
		las = (*it); it++;
	}
	//for(auto in : s) cout << in << " in\n";
	return ans;
}

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