제출 #1085163

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1085163		Timosh	Gap (APIO16_gap)	C++17	30 / 100	54 ms	5872 KiB

gap

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

long long mn = 0, mx = 0;
set<long long> st;

long long findGap(int T, int N)
{
	long long ans = 1;
	if (T == 2 && N >= 4)
	{
		MinMax(0, 1e18, &mn, &mx);
		long long left = mn;
		long long l = mn + 1, r = mx - 1;
		long long ans = 1;
		long long last = mn;
		if (mx - mn == N - 1)
			return 1;
		if (mx - mn == N)
			return 2;
		for (int i = 0; i < N; i++)
		{
			int nxt = l + (r - left) / (long long)N - 1 + (i >= (long long)N - (r - left) % (long long)N && (r - left) % (long long)N);
			MinMax(l, nxt, &mn, &mx);
			l = nxt + 1;
			if (mn != -1)
			{
				ans = max(ans, mn - last);
				last = mx;
			}
		}
		ans = max(ans, r - last + 1);
		return ans;
	}
	else
	{
		long long l = 0, r = 1e18;
		while (1)
		{
			MinMax(l, r, &mn, &mx);
			if (mn == -1)
				break;
			st.insert(mn);
			st.insert(mx);
			l = mn + 1, r = mx - 1;
			if (mn == mx || (long long)st.size() >= N)
				break;
		}
	}
	long long last = *st.begin();
	for (auto &i : st)
		ans = max(ans, i - last), last = i;
	return ans;
}

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