Submission #632797

#TimeUsernameProblemLanguageResultExecution timeMemory
632797dozerGap (APIO16_gap)C++14
0 / 100
56 ms1164 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

long long findGap(int T, int N)
{
	long long l, r;
	MinMax(1, 1e18, &l, &r);
	long long lim = (r - l) / N;
	long long ans = lim, curr = l;
	while(curr < r)
	{
		long long a, b;
		MinMax(curr + 1, min(curr + lim, r - 1), &a, &b);
		if (a == -1) curr += lim;
		else
		{
			ans = max(ans, a - l);
			l = b;
			curr += lim;
		}
	}
	ans = max(ans, r - l);
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...