Submission #906910

#	Time	Username	Problem	Language	Result	Execution time	Memory
906910		ByeWorld	Gap (APIO16_gap)	C++14	0 / 100	69 ms	8028 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+10;
typedef pair<ll,ll> pii;
typedef pair<ll,pii> ipii;

ll mn, mx;
ll x, y;
int n;
set<ll> s; ll ans = -INF;

void sol(ll l, ll r){ // cari semua di range l-r
	cout << l << ' '<< r << " p\n";
	if(l > r) return;
	MinMax(l, r, &mn, &mx);
	if(mn == -1) return; // gk ada

	s.insert(mn); s.insert(mx);

	int tmn = mn, tmx = mx;
	tmn++; tmx--;
	sol(tmn, ((tmn+tmx)>>1) ); 
	//cout << ((tmn+tmx)>>1)+1 << ' '<< tmx << " oo\n";
	sol(((tmn+tmx)>>1)+1, tmx);
}

long long findGap(int T, int N)
{
	n = N;
	sol(0, INF);
	//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: 0 / 30
• Subtask 2: 0 / 70