Submission #1223614

#	Time	Username	Problem	Language	Result	Execution time	Memory
1223614		lrnnz	Gap (APIO16_gap)	C++20	30 / 100	54 ms	1192 KiB

gap

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include "gap.h"
using namespace std;
 
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())
 
/********* DEBUG *********/
 
template <typename T>
void outvec(const vector<T>& Z){
    for (const T& x : Z)
    cout << x << ' ';
    cout << "\n";
}
void printVariable(const any& var) {
    if (!var.has_value()) {
        cout << "null";
        return;
    }

    if (var.type() == typeid(int)) {
        cout << any_cast<int>(var);
    } else if (var.type() == typeid(double)) {
        cout << any_cast<double>(var);
    } else if (var.type() == typeid(float)) {
        cout << any_cast<float>(var);
    } else if (var.type() == typeid(char)) {
        cout << any_cast<char>(var);
    } else if (var.type() == typeid(bool)) {
        cout << (any_cast<bool>(var) ? "true" : "false");
    } else if (var.type() == typeid(string)) {
        cout << any_cast<string>(var);
    } else if (var.type() == typeid(const char*)) {
        cout << any_cast<const char*>(var);
    } else if (var.type() == typeid(long long)) {
        cout << any_cast<long long>(var);
    } else {
        cout << "[unknown type]";
    }
}

template<typename... Args>
void outval(Args... args) {
    vector<any> variables = {args...};
    
    for (size_t i = 0; i < variables.size(); ++i) {
        printVariable(variables[i]);
        if (i != variables.size() - 1) {
            cout << " ";
        }
    }
    cout << "\n";
}

#define sp << " " <<

/********* DEBUG *********/

const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll inf = 1e18;
const ll mxN = 2000005;

ll st1(ll N){
    ll ans = 0;

    ll l = 0, r = 1e18;
    ll mn, mx;
    MinMax(l,r,&mn,&mx);

    l = mn, r = mx;
    ll i = 1, j = N;
    
    while (i < j){
        if (i + 1 == j){
            ans = max(ans, r-l);
            break;
        }

        MinMax(l+1,r-1,&mn,&mx);

        ans = max({ans, mn-l, r-mx});
        l = mn, r = mx;

        i++;
        j--;
    }

	return ans;
}

ll st2(ll N){
    ll l = 0, r = 1e18;
    ll mn=10, mx=30;
    MinMax(l,r,&mn,&mx);

    l = mn, r = mx;
    ll interval = (r-l+1+N-1)/N, ans = 0;
    ll back = l;

    if (interval != 1){
        MinMax(l+1, l+interval-1, &mn, &mx);
        ans = max({ans, mx - mn, mn-back});
        back = mx;
    }

    for (int i = 1; i < N; i++){
        MinMax(l + i * interval, min(l + (i + 1) * interval - 1, r), &mn, &mx);
        if (mn == -1)
            continue;

        ans = max({ans, mx-mn, mn-back});
        back = mx;
    }

    return ans;
}

ll findGap(int T, int N){
    if (T == 1)
        return st1(N);
    return st2(N);
}

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