제출 #931150

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
931150		Amirreza_Fakhri	Gap (APIO16_gap)	C++17	30 / 100	34 ms	2216 KiB

gap

// In the name of the God

#include "gap.h"

#include <bits/stdc++.h>
#define ll long long
// #define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(), (x).end()
using namespace std;

const int inf = 1e9+7;
const int mod = 998244353;
const ll maxn = 1e18;

ll a[100005];

ll findGap(int t, int n) {
    if (t == 1) {
        ll s = 0ll, e = maxn;
        for (ll l = 1, r = n; l <= r; l++, r--) {
            ll mn, mx;
            MinMax(s, e, &mn, &mx);
            a[l] = mn;
            a[r] = mx;
            s = mn + 1, e = mx - 1;
        }
        ll ans = 0;
        for (ll i = 2; i <= n; i++) smax(ans, a[i] - a[i-1]);
        return ans;
    }
    ll mn, mx;
    MinMax(0ll, maxn, &mn, &mx);
    ll g = (mn-mx+n-2)/(n-1);
    ll ans = g, l = mn;
    for (ll i = mn; i <= mx; i += g+1) {
        MinMax(i, min(i+g, mx), &mn, &mx);
        if (mn != -1) smax(ans, mn-l), l = mx;
    }
    return ans;
}

// int32_t main() {
//     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//     return 0;
// }

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