제출 #108025

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
108025		luciocf	Gap (APIO16_gap)	C++14	30 / 100	406 ms	2040 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

const int maxn = 1e5+10;
const long long maxv = 1e18;

typedef long long ll;

ll a[maxn];

long long findGap(int T, int N)
{
	if (T == 1)
	{
		ll mn, mx;
		MinMax(0, maxv, &mn, &mx);

		int l = 1, r = N;
		a[1] = mn, a[N] = mx;

		while (true)
		{
			if (r-l <= 1) break;

			MinMax(a[l]+1, a[r]-1, &mn, &mx);

			a[++l] = mn, a[--r] = mx;
		}

		ll ans = 0;
		for (int i = 1; i < N; i++)
			ans = max(ans, a[i+1]-a[i]);

		return ans;
	}

	ll s = 0;

	for (int l = 1; l <= N;)
	{
		ll mn, mx;

		for (ll i = 0; i < 60 && s+(1<<i) <= maxv; i++)
		{
			ll t = s+(1<<i);

			MinMax(s, t, &mn, &mx);

			if (mn != -1 && mx != -1) break;
		}

		a[l++] = mn;
		s = a[l-1]+1;
	}

	ll ans = 0;
	for (int i = 1; i < N; i++)
		ans = max(ans, a[i+1]-a[i]);

	return ans;
}

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