Submission #1030063

#	Time	Username	Problem	Language	Result	Execution time	Memory
1030063		KasymK	Gap (APIO16_gap)	C++17	30 / 100	43 ms	3748 KiB

gap

#include "bits/stdc++.h"
#include "gap.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int MOD = 1e9+7;
const int N = 1e5+5;
ll a[N];

ll findGap(int t, int n){
	if(t == 1){
		ll l = 0, r = 1e18, id = 0, mn, mx, ans = 0;
        for(int i = 0; i < (n+1)/2; ++i){
            MinMax(l, r, &mn, &mx);
            a[id++] = mn, a[id++] = mx, l = mn+1, r = mx-1;
        }
        sort(a, a+n);
        for(int i = 0; i < n-1; ++i)
        	umax(ans, a[i+1]-a[i]);
        return ans;
    }
    ll a_, b_, mn, mx, id = 0, l = 0, r = 1e18;
	MinMax(l, r, &mn, &mx);
	ll d = (mx-mn-1)/(n-1);
	a[id++] = mn;
	for(ll i = mn+1; i < mx; i+=d+1){
		MinMax(i, min(i+d, mx-1), &a_, &b_);
		if(a_ != -1)	
			a[id++] = a_, a[id++] = b_;
	}
	a[id++] = mx;
	id--;
	// for(int i = 0;; ++i)
	// 	if(a[i]){
	// 		id = i;
	// 		break;
	// 	}
	ll ans = 0;
	for(int i = 0; i < id-1; ++i)
		umax(ans, a[i+1]-a[i]);
	return ans;
}

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