제출 #388578

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
388578		talant117408	Gap (APIO16_gap)	C++17	100 / 100	69 ms	2364 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
 
using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

ll findGap(int T, int n) {
	if (T == 1) {
		vector <ll> v;
		ll l = 1, r = 1e18;
		ll mn = 0, mx = 0;
		while (l <= r) {
			if (sz(v) == n) break;
			MinMax(l, r, &mn, &mx);
			if (mn == -1 && mx == -1) {
				break;
			}
			v.pb(mn);
			if (mn != mx) v.pb(mx);
			l = mn+1; r = mx-1;
		}
		sort(all(v));
		ll ans = 0;
		for (int i = 0; i < n-1; i++) ans = max(ans, v[i+1]-v[i]);
		return ans;
	}
	else {
		vector <ll> v;
		ll mn, mx;
		MinMax(0, 1e18, &mn, &mx);
		ll k = (mx-mn+n-1)/n;
		v.pb(mn); v.pb(mx);
		ll MN = mn, MX = mx;
		for (ll i = MN+1; i <= MX-1; i += k) {
			MinMax(i, min(MX-1, i+k-1), &mn, &mx);
			if (mn != -1 && mx != -1) {
				if (mn == mx) {
					v.pb(mn);
				}
				else {
					v.pb(mn); v.pb(mx);
				}
			}
		}
		sort(all(v));
		ll ans = 0;
		for (int i = 0; i < sz(v)-1; i++) ans = max(ans, v[i+1]-v[i]);
		return ans;
	}
}

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