제출 #1183626

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1183626		Tymond	Gap (APIO16_gap)	C++20	0 / 100	40 ms	3260 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct pair_hash{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

const ll INF = 1e18;

ll brut(int n){
    vll a(n);
    ll l = 0LL;
    ll p = INF;
    for(int i = 0; i < n / 2; i++){
        ll x, y;
        MinMax(l, p, &x, &y);
        a[i] = x;
        a[n - i - 1] = y;
        l = x + 1;
        p = y - 1;
    }

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

ll findGap(int T, int n){
    if(T == 1){
        return brut(n);
    }
    ll mn, mx;
    MinMax(0LL, INF, &mn, &mx);
    ll R = mx - mn;
    if(mx == mn){
        return 0LL;
    }

    vector<pll> vec;
    ll x = mn;
    ll ans = 0LL;
    for(int i = 0; i < n - 1; i++){
        ll len = R / (n - 1);
        //if(R % (n - 1) > i){
        //    len++;
        //}
        ll currMn, currMx;
        MinMax(x, x + len, &currMn, &currMx);
        if(currMn != (ll)-1){
            vec.pb(mp(currMn, currMx));
        }
        x += (len + 1);
    }

    for(int i = 0; i + 1 < sz(vec); i++){
        ans = max(ans, vec[i + 1].fi - vec[i].se);
    }

    return ans;
}

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