제출 #1262619

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1262619		yf_yusuf	Gap (APIO16_gap)	C++20	0 / 100	2096 ms	2060 KiB

gap

#include "gap.h"
//```//    YF YUSUF
#define YF ios_base::sync_with_stdio(0);cout.setf(ios::fixed);
#define YUSUF cout.precision(0);cout.tie(0);cin.tie(0);
// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <queue>
#include <stack>
#include <cassert>
#include <climits>
#include <string>
#include <cstdlib>
#include <random>
#include <ctime>
using namespace std;
#ifdef YF_CHECK
	bool Output=1;
#else
	#pragma GCC optimize ("unroll-loops")
	#pragma GCC optimize ("inline")
	#pragma GCC optimize ("Ofast")
	#pragma GCC optimize ("O3")
	bool Output=0;
#endif
using ll   = long long;
using ld   = long double;
using sll  = set <ll>;
using vll  = vector <ll>;
using mll  = map <ll,ll>;
using pll  = pair <ll,ll>;
using vvl  = vector <vll>;
using vpll = vector <pll>;
template<class T>T MIN(T&a,T b){a=min(a,b);return a;}
template<class T>T MAX(T&a,T b){a=max(a,b);return a;}
#define all(a) a.begin(),a.end()
#define sgr v+v+1,(tl+tr)/2+1,tr
#define sgl v+v,tl,(tl+tr)/2
#define pb push_back
#define ins insert
#define S second
#define F first
mt19937_64 MT(time(0));
ll BP(ll a,ll b,ll mod=1e9+7){
	if(b==0)return 1;
	ll q=BP(a,b/2,mod);
	return ((q*q)%mod*(b%2?a:1ll))%mod;
}
ll f(ll x){return x*(x+1)/2;}
ll dup(ll a,ll b){return (a+b-1)/b;}
ll lcm(ll a,ll b){return a/__gcd(a,b)*b;}
ll invf(ll x){return (-1+sqrt(1+8*x))/2;}
const ll  mod=998244353;
const ll  INF=1e18;
const ll  inf=1e9+7;
const ll  N  =1e6+7;
set<ll>st;
void dac(ll l,ll r){
	if(l > r)return;
	ll m = (l+r)/2;
	ll x,y,X,Y;
	MinMax(l, m, &x, &y);
	MinMax(m+1, r, &X, &Y);
	if(x!=-1){
		st.ins(x);
		st.ins(y);
		dac(x+1,y-1);
	}
	if(X!=-1){
		st.ins(X);
		st.ins(Y);
		dac(x+1, Y-1);
	}
}
ll YF_SOLVE(ll n){
	st.clear();
	vll a(n+1);
	{
		ll l = 0ll, r = (1000000000000000000LL);
		MinMax(l, r, &a[1], &a[n]);
	}
	dac(a[1]+1, a[n]-1);
	st.ins(a[n]);
	st.ins(a[1]);
	ll cnt = 0, mx = 0;
	for(auto i : st)a[++cnt] = i;
	for(int i=2;i<=n;i++){
		MAX(mx, a[i] - a[i-1]);
	}
	return mx;
}
ll lg(ll x){return (x ? 63 - __builtin_clzll(x) : -1);}
const ll SN=2e0 + 7; ll SM[SN];
const ll FN=2e0 + 7; ll FACT[FN], inv[FN], FMOD=inf;
ll PER(ll n,ll k){return FACT[n] *inv[n-k]%FMOD;}
ll CNK(ll n,ll k){return PER(n,k)*inv[k  ]%FMOD;}
void BEFORE(){
	for(ll i=2;i<SN;i++){
		if(SM[i])continue;
		for(ll j=i;j<SN;j+=i)
			MAX(SM[j],i);
	}
	FACT[0]=inv[0]=1;
	for(int i=1;i<FN;i++){
		FACT[i]=FACT[i-1]*i%FMOD;
		if(i<5e5+7)inv[i]=BP(FACT[i],FMOD-2,FMOD);
	}
}
ll findGap(int T, int N)
{
	YF YUSUF
	return YF_SOLVE(N);
}

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