Submission #1015125

#TimeUsernameProblemLanguageResultExecution timeMemory
1015125vjudge1Gap (APIO16_gap)C++17
0 / 100
37 ms2612 KiB
#include <bits/stdc++.h>
// #include "grader.cpp"
#include "gap.h"

using namespace std;

typedef long long ll;

ll findGap(int T, int N){
    if (T == 1){
        vector<ll> vec;
        ll mn = 0, mx = 1e18;
        while (N > 0){
            N -= 2;

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

            vec.push_back(mn);
            vec.push_back(mx);
            
            mn++;
            mx--;
        }

        sort(vec.begin(), vec.end());
        
        ll res = 0;
        for (int i = 1; i < N; i ++)
            res = max(res, vec[i] - vec[i - 1]);
        return res;
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...