Submission #23021

#TimeUsernameProblemLanguageResultExecution timeMemory
23021arman_ferdousGap (APIO16_gap)C++14
30 / 100
59 ms4900 KiB
const long long MAXN = 1e18;
void MinMax(long long , long long , long long *, long long *);
long long findGap(int T, int N)
{
    long long aray[N], i = 0, j = N-1, lo = 0, hi = MAXN;
    while(j-i >= 0)
    {
        long long x, y;
        MinMax(lo,hi,&x,&y);
        aray[i] = x, aray[j] = y;
        i++, j--;
        lo = x+1;
        hi = y-1;
    }
 
    long long res = -1;
    for(int i = 0; i+1 < N; i++)
        res = (res < aray[i+1]-aray[i] ? aray[i+1]-aray[i] : res);
    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...