제출 #400104

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
400104		dxz05	Gap (APIO16_gap)	C++14	86.31 / 100	76 ms	1916 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 555555;
const long long INF = 1e18 + 2e2;

typedef long long ll;

ll a[MAXN];

long long findGap(int SUBTASK, int n){
    if (SUBTASK == 1){
        ll mn = 0, mx = 1e18;
        for (int i = 1; i <= (n + 1) / 2; i++){
            MinMax(mn, mx, &a[i], &a[n - i + 1]);
            mn = a[i] + 1;
            mx = a[n - i + 1] - 1;
        }

        ll ans = 0;
        for (int i = 1; i < n; i++) ans = max(ans, a[i + 1] - a[i]);

        return ans;
    } else {
        ll mn, mx;
        MinMax(0, INF, &mn, &mx);

        a[1] = mn;
        a[n] = mx;

        ll x = (mx - mn + n - 2) / (n - 1);
        ll ans = x;

        ll l = mn + 1, last = mn;
        while (last + x < a[n]){
            MinMax(l, l + x, &mn, &mx);
            if (mn == -1){
                l += x;
            } else {
                ans = max(ans, mn - last);
                last = mx;
                l = last + 1;
            }
        }

        return ans;
    }
}

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