Submission #354926

#TimeUsernameProblemLanguageResultExecution timeMemory
354926blueGap (APIO16_gap)C++17
0 / 100
49 ms1260 KiB
#include "gap.h"
#include <algorithm>
#include <cmath>
using namespace std;

long long findGap(int T, int N)
{
    long long res = 0;

    if(T == 1)
    {
        long long s, t;
        long long mn;
        long long mx;

        s = 0;
        t = 1000'000'000'000'000'000LL;

        MinMax(s, t, &mn, &mx);
        while(mn < mx)
        {
            s = mn + 1;
            t = mx - 1;

            MinMax(s, t, &mn, &mx);

            if(mn == -1)
            {
                if(N % 2 == 0) res = max(res, t - s + 2);
                break;
            }

            res = max(res, mn - (s-1));
            res = max(res, (t+1) - mx);
        }
    }

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