#include "bits/stdc++.h"
#include "gap.h"
// #include "grader.cpp"
using namespace std;
#define ll long long
#define pb push_back
ll n, s, answer, mn, mx, ans, l, r;
set <ll> v;
ll findGap(int T,int N) {
MinMax(0, LLONG_MAX, &l, &r);
v.insert(l);
v.insert(r);
while((int)v.size() < N) {
MinMax(l + 1, l + 2, &mn, &mx);
if(~mn) {
v.insert(mn);
v.insert(mx);
}
l += 3;
}
ans = *v.begin();
for(auto i : v) {
answer = max(answer, i - ans);
ans = i;
}
return answer;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |