제출 #1222227

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1222227		countless	Gap (APIO16_gap)	C++20	30 / 100	41 ms	2912 KiB

gap

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

typedef long long ll;
typedef long double ld;

const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-12;

#define endl "\n"
#define sp <<" "<<
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define dbg(x) cout << #x << " = " << x << endl
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())

struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}

	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
};

template <typename Key, typename Value>
using hash_map = unordered_map<Key, Value, custom_hash>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(a, b)(rng);
// shuffle(all(a), rng);

ll findGap(int T, int N) {
	if (T == 1) {
		ll a = 0, b = 1e18;
		vector<ll> nums;
		while ((int)nums.size() < N) {
			ll c, d;
			MinMax(a, b, &c, &d);
			nums.push_back(c);
			if (c != d) nums.push_back(d);
			a = c + 1;
			b = d - 1;
		}
		sort(all(nums));

		ll ans = LLONG_MIN;
		REP(i, 1, N) ans = max(ans, nums[i] - nums[i-1]);

		return ans;
	} else

	if (T == 2) {
		vector<ll> nums;
		vector<pair<ll, ll>> ranges, nranges, cranges;

		ll lb, ub;
		MinMax(0, 1e18, &lb, &ub);

		ll len = (ub - lb + N - 2) / (N - 1);
		ll ans = 0, run = lb;

		vector<ll> lbs, ubs;
		ubs.push_back(lb);

		REP(i, 0, N - 1) {
			ll a = lb + i * len, b = min(ub, a + len - 1);
			ll x, y;
			MinMax(a, b, &x, &y);

			if (x != -1 and y != -1) {
				lbs.push_back(x);
				ubs.push_back(y);
			}
		}

		lbs.push_back(ub);

		assert(lbs.size() == ubs.size());

		ll N = lbs.size();
		REP(i, 0, N) {
			ans = max(ans, lbs[i] - ubs[i]);
		}

		return ans;
	}

	return 0;
}

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