Submission #1341275

#TimeUsernameProblemLanguageResultExecution timeMemory
1341275kawhietGap (APIO16_gap)C++20
0 / 100
2096 ms2164 KiB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;

long long findGap(int _, int n) {
	long long mn = 0, mx = 1e18;
	MinMax(mn, mx, &mn, &mx);
	int gap = (mx - mn + n - 2) / (n - 1);
	long long l = mn, r = mx;
	vector<long long> a;
	while (l + gap <= r) {
		long long x = 0, y = 0;
		MinMax(l, l + gap, &x, &y);
		if (x != -1) {
			a.push_back(x);
		}
		if (x != y) {
			a.push_back(y);
		}
		l += gap + 1;
	}
	long long ans = gap;
	for (int i = 1; i < a.size(); i++) {
		ans = max(ans, a[i] - a[i - 1]);
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...