Submission #167863

#TimeUsernameProblemLanguageResultExecution timeMemory
167863stefdascaGap (APIO16_gap)C++14
30 / 100
55 ms2844 KiB
#include<bits/stdc++.h>
#include "gap.h"
using namespace std;

long long v[100002];

long long findGap(int T, int N)
{
    long long ans = 0;
    if(T == 1)
    {
        int a = 1;
        int b = N;
        long long st = 0;
        long long dr = 1;
        for(int i = 1; i <= 18; ++i)
            dr = dr * 10LL;
        while(a <= b)
        {
            long long st2;
            long long dr2;
            if(a == 1)
                MinMax(st, dr, &st2, &dr2);
            else
                MinMax(st+1, dr-1, &st2, &dr2);
            v[a] = st2;
            v[b] = dr2;
            ++a;
            --b;
            st = st2;
            dr = dr2;
        }
        for(int i = 1; i < N; ++i)
            ans = max(ans, v[i+1] - v[i]);
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...