제출 #1223504

#제출 시각아이디문제언어결과실행 시간메모리
1223504fishy15Gap (APIO16_gap)C++20
70 / 100
47 ms1192 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...