제출 #381909

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381909		ijxjdjd	Gap (APIO16_gap)	C++14	56.31 / 100	73 ms	2032 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
using ll = long long;

long long findGap(int T, int N)
{

    if (T == 1) {
        ll low = 0;
        ll high = (ll)(1e18);
        ll arr[N];
        int l = 0;
        int r = N-1;
        while (low < high) {
            MinMax(low, high, &low, &high);
            arr[l++] = low;
            arr[r--] = high;
            low++;
            high--;
        }
        ll mx = 0;
        for (int i = 1; i < N; i++) {
            mx = std::max(mx, arr[i] - arr[i-1]);
        }
        return mx;
    }
    else {
        ll first = 0;
        ll last = 0;
        MinMax(first, (ll)(1e18), &first, &last);
        ll d = (last-first)/(N-1);
        ll ans = 0;
        ll next = first+d;
        first++;
        while (first < last) {
            ll mn, mx;
            MinMax(first, next, &mn, &mx);
            if (mn != -1) {
                ans = std::max(mn - (first-1), ans);
                first = mx+1;
                next = mx;
            }
            next += d;
        }
        return ans;
    }
}

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