Submission #745104

#	Time	Username	Problem	Language	Result	Execution time	Memory
745104		Nelt	Gap (APIO16_gap)	C++17	40.18 / 100	408 ms	1972 KiB

gap

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

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

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
	ios_base::sync_with_stdio(0); \
	cin.tie(0);                   \
	cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll findGap(int t, int n)
{
	ll ans = 0;
	if (t == 1)
	{
		ll a[n];
		ll i = 0, j = n - 1, l = 0, r = 1e18;
		while (i <= j)
			MinMax(l, r, &a[i], &a[j]), l = a[i++] + 1, r = a[j--] - 1;
		for (ll i = 1; i < n; i++)
			ans = max(ans, a[i] - a[i - 1]);
	}
	else
	{
		ll l, r, f, s, cur;
		MinMax(0, 1e18, &f, &s);
		l = 1, r = s - f;
		// cout << l << " " << r << endl;
		cur = f;
		while (l <= r)
		{
			ll mid = (l + r) >> 1, x, y;
			bool ok = true;
			while (cur < s)
			{
				MinMax(cur + 1, cur + mid, &x, &y);
				if (x != -1)
					cur = y;
				else
				{
					ok = false;
					break;
				}
			}
			if (ok)
				cur = f, r = mid - 1, ans = mid;
			else
				l = mid + 1;
		}
	}
	return ans;
}

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