Submission #206193

#	Time	Username	Problem	Language	Result	Execution time	Memory
206193		mraron	Gap (APIO16_gap)	C++14	43.01 / 100	103 ms	9332 KiB

gap

#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
set<ll> res;
int n;
void solve2(ll L, ll R) {
	if((int)res.size()==n||L>R) return ;
	ll a,b;
	MinMax(L,R,&a,&b);
	if(a==-1) return ;
	res.insert(a);
	res.insert(b);
	solve2(a+1,(a+b)/2);
	solve2((a+b)/2+1, b-1);
}	

void solve1(ll L, ll R) {
	if((int)res.size()==n||L>R) return ;
	ll a,b;
	MinMax(L,R,&a,&b);
	if(a==-1) return ;
	res.insert(a);
	res.insert(b);
	solve1(a+1,b-1);
}	

ll findGap(int T, int N)
{
	n=N;
	if(T==2) {
		solve2(0, 1000000000000000000LL);
	}else {
		solve1(0, 1000000000000000000LL);
	}
	vector<ll> ans;
	for(auto i:res) ans.push_back(i);
	ll val=0;
	for(int i=1;i<(int)ans.size();++i) val=max(val, ans[i]-ans[i-1]);
	return val;
	
}

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