Submission #960079

#TimeUsernameProblemLanguageResultExecution timeMemory
960079MinaRagy06Gap (APIO16_gap)C++17
70 / 100
46 ms3112 KiB
#include <bits/stdc++.h>
#include "gap.h"
#ifdef MINA
#include "grader.cpp"
#endif
using namespace std;
#define ll long long

const ll inf = 1e18;
ll findGap(int t, int n) {
	ll s, e;
	MinMax(0, inf, &s, &e);
	if (n == 2) {
		return e - s;
	}
	ll len = e - s;
	ll b = (len + n - 2) / (n - 1);
	ll lst = s, mx = b;
	ll en = e;
	for (ll i = s + 1; i <= en - 1; i += b) {
		MinMax(i, min(i + b - 1, en - 1), &s, &e);
		if (s == -1) continue;
		mx = max(mx, s - lst);
		lst = e;
	}
	mx = max(mx, en - lst);
	return mx;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...