Submission #1168483

#TimeUsernameProblemLanguageResultExecution timeMemory
1168483AgageldiGap (APIO16_gap)C++20
30 / 100
45 ms5792 KiB
#include "bits/stdc++.h"
#include "gap.h"
// #include "grader.cpp"
using namespace std;

#define ll long long

ll n, l = 0, r = LLONG_MAX, mn = 0, mx = 0;
set <ll> s;
ll ans, answer;

ll findGap(int T,int N) {
	while(n < N && l < r) {
		MinMax(l, r, &mn, &mx);
		if(mn == -1 || mx == -1) break;
		s.insert(mn);
		s.insert(mx);
		n += 2;
		l = mn + 1, r = mx - 1;
	}
	answer = 0, ans = *s.begin();
	for(auto i : s) {
		answer = max(answer, i - ans);
		ans = i;
	}
	return answer;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...