Submission #144669

#	Time	Username	Problem	Language	Result	Execution time	Memory
144669		cheetose	Gap (APIO16_gap)	C++11	89.02 / 100	77 ms	3304 KiB

gap

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 9876543219876543
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

#include "gap.h"
const ll inf=1e18;
ll a[100001];
ll findGap(int T,int N)
{
	if(T==1)
	{
		MinMax(1,inf,&a[0],&a[N-1]);
		int i=1,j=N-2;
		while(i<=j)
		{
			MinMax(a[i-1]+1,a[j+1]-1,&a[i],&a[j]);
			i++,j--;
		}
		ll ans=-1;
		fup(i,1,N-1,1)ans=max(ans,a[i]-a[i-1]);
		return ans;
	}
	else
	{
		ll t1,t2,r1,r2;
		MinMax(1,inf,&t1,&t2);
		ll t=(t2-t1)/(N-1);
		Vll v;
		v.pb(t1);v.pb(t2);
		if(N==2)return t;
		ll ans=t;
		fup(i,0,N-1,1)
		{
			MinMax(t1+t*i+i,t1+t*(i+1)+i,&r1,&r2);
			if(r1!=-1)
			{
				v.pb(r1);v.pb(r2);
			}
		}
		sort(ALL(v));
		fup(i,1,(int)v.size()-1,1)ans=max(ans,v[i]-v[i-1]);
		return ans;
	}
}

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