Submission #1173313

#TimeUsernameProblemLanguageResultExecution timeMemory
1173313woohyun_jngGap (APIO16_gap)C++20
53.51 / 100
40 ms2236 KiB
#include "gap.h"

#include <bits/stdc++.h>
#define int long long

using namespace std;

int findGap(signed T, signed N) {
    int A, B, X, Y, K, ans = 0;

    MinMax(0, 1'000'000'000'000'000'000, &X, &Y);
    K = (Y - X + N - 2) / (N - 1);

    vector<int> arr;

    for (int i = X; i <= Y; i += K) {
        MinMax(i, i + K - 1, &A, &B);
        if (A != -1) {
            if (!arr.empty())
                ans = max(ans, A - arr.back());
            arr.push_back(B);
        }
    }

    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...