| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1223504 | fishy15 | Gap (APIO16_gap) | C++20 | 47 ms | 1192 KiB |
#include <algorithm>
#include "gap.h"
using namespace std;
using ll = long long;
constexpr ll MAX = 1'000'000'000'000'000'000;
ll findGap(int T, int N) {
ll mn, mx;
MinMax(0, MAX, &mn, &mx);
auto gap_size = (mx - mn + N - 1) / N;
ll cur = mn + 1;
ll last = mn;
ll ans = 0;
while (cur <= mx) {
ll cur_mn, cur_mx;
MinMax(cur, cur + gap_size - 1, &cur_mn, &cur_mx);
if (cur_mn != -1) {
ans = max(ans, cur_mn - last);
}
if (cur_mx != -1) {
last = cur_mx;
}
cur += gap_size;
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
