Submission #376275

#	Time	Username	Problem	Language	Result	Execution time	Memory
376275		blue	Gap (APIO16_gap)	C++17	30 / 100	60 ms	2832 KiB

gap

#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;

        if(N % 2 == 0)
        {
            MinMax(s, t, &mn, &mx);
            s = mn + 1;
            t = mx - 1;
            for(int i = 2; i <= N/2; i++)
            {
                MinMax(s, t, &mn, &mx);
                res = max(res, mn - (s-1));
                res = max(res, (t+1) - mx);

                s = mn + 1;
                t = mx - 1;
            }
            res = max(res, mx - mn);
        }
        else
        {
            MinMax(s, t, &mn, &mx);
            s = mn + 1;
            t = mx - 1;
            for(int i = 2; i <= (N+1)/2; i++)
            {
                MinMax(s, t, &mn, &mx);
                res = max(res, mn - (s-1));
                res = max(res, (t+1) - mx);

                s = mn + 1;
                t = mx - 1;
            }
        }
    }
    else if(T == 2)
    {
        long long s, t;
        long long mn, mx;

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

        MinMax(s, t, &mn, &mx); //M += N+1

        long long a1 = mn, aN = mx;
        long long gap = (aN-a1)/(N-1) + ((aN-a1) % (N-1) != 0);

        vector<long long> L, R;
        for(long long x = a1; x <= aN; x += gap)
        {
            MinMax(x, x+gap-1, &mn, &mx);
            if(mn == -1) continue;
            L.push_back(mn);
            R.push_back(mx);

            if(L.size() >= 2)
            {
                res = max(res, L[L.size()-1] - R[L.size()-2]);
                gap = max(gap, res);
            }
        }
    }

    return res;
}

• Subtask 1: 30 / 30
• Subtask 2: 0 / 70