제출 #735876

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
735876		Abrar_Al_Samit	Gap (APIO16_gap)	C++17	100 / 100	52 ms	1872 KiB

gap

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

const long long INF = 1e18;


long long solve1(int N) {
	long long a[N+1];
	int l = 1, r = N;

	long long lef = 0, rit = INF;
	while(l<=r) {
		MinMax(lef, rit, &lef, &rit);
		if(l==r) {
			a[l] = lef;
			break;
		} else {
			a[l] = lef, a[r] = rit;
			++lef, --rit;
			++l, --r;
		}
	}

	long long best = 0;
	for(int i=2; i<=N; ++i) {
		best = max(best, a[i] - a[i-1]);
	}
	return best;
}
long long solve2(int N) {
	long long lef = 0;
	long long absmn, absmx = INF;
	MinMax(0, INF, &absmn, &absmx);
	lef = absmn + 1;
	long long already = (absmx-absmn+N)/N;

	while(lef+already+1<=absmx) {
		long long pw = already;
		while(1) {
			long long rit = min(INF, pw+lef-1);

			long long var1, var2;
			MinMax(lef, rit, &var1, &var2);
			if(var1==-1) {
				pw *= 2;
			} else {
				already = max(already, var1 - lef + 1);
				lef = var2 + 1;
				break;
			}
		}
	}
	return already;
}
long long findGap(int T, int N) {
	if(T==1) return solve1(N);
	else return solve2(N);
}

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