Submission #672304

#	Time	Username	Problem	Language	Result	Execution time	Memory
672304		Dan4Life	Gap (APIO16_gap)	C++17	30 / 100	46 ms	2256 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) (int)a.size()
const int maxn = 5e5+10;
const ll LINF = (ll)2e18;

ll ans=1,mn=-1,mx=-1,nn;
set<ll> S;

void query(ll l, ll r, ll &mn, ll &mx){
	ll t1, t2;
	if(l<=r) MinMax(l,r,&t1,&t2);
	mn=t1, mx=t2;
}

void dnc(ll l, ll r, bool ok=false){
	S.insert(l), S.insert(r);
	if(sz(S)==nn) return;
	ll mid = (l+r)/2ll, l2=-1, r2=-1, l3=-1, r3=-1;

	query(l+1,mid,l2,r2);
	if(l2!=-1) ans = max(ans, l2-l);

	query(mid+1,r-1,l3,r3);
	if(r3!=-1) ans = max(ans, r-r3);

	if(r2!=-1 and l3!=-1) ans = max(ans, l3-r2);
	if(ok) return;
	if(l2!=-1 and r2!=-1) dnc(l2, r2, r2-l2<=ans);
	if(l3!=-1 and r3!=-1) dnc(l3, r3, r3-l3<=ans);
}

ll findGap(int T, int n)
{
	ll s=0, t=LINF; ans=1; S.clear(); nn=n;
	if(T==1){
		vector<ll> v; v.clear(); int x = (n+1)/2;
		while(x--) MinMax(s,t,&mn,&mx), v.pb(mn), v.pb(mx), s=mn+1, t=mx-1;
		sort(all(v));
		for(int i = 0; i < sz(v)-1; i++) 
			ans = max(ans, v[i+1]-v[i]);
		return ans;
	}
	MinMax(s,t,&mn,&mx), dnc(mn,mx);
	if(sz(S)==n){
		while(sz(S)>1){
			auto itr = S.begin(); auto itr2 = itr; itr2++;
			ans = max(ans, *itr2-*itr); S.erase(S.begin());
		}
	}
	return ans;
}

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