Submission #343834

#	Time	Username	Problem	Language	Result	Execution time	Memory
343834		amunduzbaev	Gap (APIO16_gap)	C++14	100 / 100	75 ms	2448 KiB

gap

#include "gap.h"
//#include "grader.cpp"

#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}

const int NN = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);

ll findGap(int T, int n){
	if(T == 1){
		ll l = 0, r = inf, mn, mx;
		MinMax(l, r, &mn, &mx);
		vector<ll> tmp;
		tmp.pb(mn), tmp.pb(mx);
		for(int i=1;i<(n+1)/2;i++){
			l = mn+1, r = mx-1;
			MinMax(l, r, &mn, &mx);
			if(mn == -1 || mx == -1) break; 
			tmp.pb(mn);
			if(mn != mx) tmp.pb(mx);
		}
		
		sort(all(tmp));
		ll ans = 0;
		for(int i=0;i<sz(tmp)-1;i++) umax(ans, tmp[i+1] - tmp[i]);
		
		return ans;
	}
	
	ll l = 0, r = inf, mn, mx;
	MinMax(l, r, &mn, &mx);
	ll len = (mx - mn-1)/n;
	ll ans = 0, lastr = mn, tt = mx, cnt = 0;
	mn++;
	for(l=mn; cnt < n; l+=len+1){
		cnt++;
		r = l + len;
		MinMax(l, r, &mn, &mx);
		//cout<<l<<" "<<r<<" "<<mn<<" "<<mx<<" "<<lastr<<" "<<endl;
		if(mn == -1 || mx == -1) continue;
		umax(ans, mn - lastr);
		umax(ans, mx - mn);
		lastr = mx;
	}
	umax(ans, tt - lastr);
	
/*
	
2 4
1 2 3 10

2 6
0 1000 1001 1002 1003 1004

*/
	return ans;
}

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