| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1168479 | Agageldi | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB |
#include "bits/stdc++.h"
#include "gap.h"
#include "grader.cpp"
using namespace std;
#define ll long long
ll n, l = 0, r = 1e18, mn = 0, mx = 0;
set <int> s;
int ans, answer;
ll findGap(int T,int N) {
while((int)s.size() < N && l <= r) {
MinMax(l, r, &mn, &mx);
if(mn == -1) break;
s.insert(mn);
s.insert(mx);
l = mn + 1, r = mx - 1;
}
answer = 0, ans = *s.begin();
for(auto i : s) {
answer = max(answer, i - ans);
ans = i;
}
return answer;
}