Submission #612437

#	Time	Username	Problem	Language	Result	Execution time	Memory
612437		thezomb1e	Gap (APIO16_gap)	C++17	100 / 100	70 ms	2244 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define eb emplace_back
#define pb push_back
#define ft first
#define sd second
#define pi pair<int, int>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define dbg(...) dbg_out(__VA_ARGS__)

using ll = long long;
using ld = long double;
using namespace std;
using namespace __gnu_pbds;

//Constants
const ll INF = 5 * 1e18;
const int IINF = 2 * 1e9;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ld PI = 3.14159265359;

//Templates
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) {return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) {os << '['; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << ']';}
void dbg_out() {cerr << endl;}
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << H << ' '; dbg_out(T...); }
template<typename T> void mins(T& x, T y) {x = min(x, y);}
template<typename T> void maxs(T& x, T y) {x = max(x, y);}
template<typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using omset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll MAX = 1e18;

ll findGap(int t, int n) {
	if (t == 1) {
		ll mn, mx, l = 1, r = MAX;
		vector<ll> a;
		for (int i = 0; i < (n + 1) / 2; i++) {
			MinMax(l, r, &mn, &mx);
			if (mn != mx) a.pb(mx);
			a.pb(mn);
			l = mn + 1; r = mx - 1; 
		}
		sort(all(a));
		ll ans = -INF;
		for (int i = 1; i < (int) a.size(); i++) {
			maxs(ans, a[i] - a[i - 1]);
		}
		return ans;
 	} else {
		ll mn, mx; ll big;
		MinMax(1, MAX, &mn, &mx);
		big = mx;
		ll lb = (mx - mn + n - 2) / (n - 1);
		ll i = mn, ans = lb, last = -1;
		while (i <= big) {
			MinMax(i, i + lb, &mn, &mx);
			if (mn != -1) {
				if (last != -1) {
					maxs(ans, mn - last);
				}
				last = mx;
			}
			i += lb + 1;
		}
		return ans;
	}
}

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