Submission #1187874

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187874		Malix	Gap (APIO16_gap)	C++20	30 / 100	45 ms	2360 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<ll,ll,ll> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

long long findGap(int T, int n)
{
	vector<ll> a;
	ll l=0,r=1e18,mn,mx,ans=0;
	if(T==1){
		while(a.size()!=n){
			MinMax(l,r,&mn,&mx);
			a.PB(mn);
			if(mn!=mx)a.PB(mx);
			l=mn+1;
			r=mx-1;
		}
	}
	else{
		MinMax(l,r,&mn,&mx);
		ll z=mx;
		a.PB(mn);
		ll x=(mx-mn)/n;
		l=mn+1;r=mn+x;
		REP(i,0,n){
			MinMax(l,r,&mn,&mx);
			a.PB(mn);
			if(mn!=mx)a.PB(mx);
			l=r+1;
			r=l+x;
			r=min(r,z);
		}
		n=a.size();
	}
	sort(a.begin(),a.end());
	REP(i,0,n-1)ans=max(ans,a[i+1]-a[i]);
	return ans;
}

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