| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1168443 | Agageldi | Gap (APIO16_gap) | C++20 | 45 ms | 5920 KiB |
#include "bits/stdc++.h"
#include "gap.h"
// #include "grader.cpp"
using namespace std;
#define ll long long
ll n, l = 0, r = 1e18;
ll findGap(int T,int N) {
ll mn = 0, mx = 0;
set <ll> s;
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;
}
ll answer = -1, ans = -1;
for(auto i : s) {
if(ans == -1) ans = i;
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... | ||||
