Submission #61124

#	Time	Username	Problem	Language	Result	Execution time	Memory
61124		Flugan42	Gap (APIO16_gap)	C++14	100 / 100	95 ms	2284 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef long double lld;
#define rep(i,a,b) for(ll i = a; i < b; i++)
#define per(i,a,b) for(ll i = a; i >= b; i--)
#define inf 1000000000000000000
#define all(x) x.begin(),x.end()
#define sz(x) (ll)(x).size()
#define trav(a,x) for(auto a : x)

long long findGap(int T, int N)
{
	if (T == 1){
		vi a; a.assign(N,0);
		MinMax(0,inf,&a[0],&a[N-1]);
		ll f=1,l=N-2;
		while (f<=l){
			MinMax(a[f-1]+1,a[l+1]-1,&a[f],&a[l]);
			f++; l--;
		}
		ll best = 0;
		rep(i,1,N) if (a[i]-a[i-1] > best) best = a[i]-a[i-1];
		return best;
	} else {
		ll mn,mx,t1,t2;
		MinMax(0,inf,&mn,&mx);
		vi d; d.assign(N,(mx-mn-1)/N);
		rep(i,0,(mx-mn-1)%N) d[i]++;
		ll cur = mn+1,gap = 0,best = 0;
		rep(i,0,N){
			if (d[i] == 0) continue;
			MinMax(cur,cur+d[i]-1,&t1,&t2);
			if (t1 == -1) gap += d[i];
			else {
				best = max(best,gap+t1-cur);
				gap = cur+d[i]-1-t2;
			}
			cur += d[i];
		}
		best = max(best,gap);
		return best+1;
	}
}

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