Submission #1253949

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253949		antonn	Packing Biscuits (IOI20_biscuits)	C++20	100 / 100	52 ms	964 KiB

biscuits

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

template<typename T>
bool assign_min(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool assign_max(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

ll count_tastiness(ll x, vector<ll> a) {
    while (a.size() < 62) {
        a.push_back(0);
    }
    
    vector<ll> pref(62);
    for (int i = 0; i < 62; i++) {
        pref[i] = (i == 0 ? 0 : pref[i - 1]) + (a[i] << i);
    }
    
    map<ll, ll> f;
    auto solve = [&](auto self, ll n) {
        if (f.count(n)) {
            return f[n];
        }
        if (n <= 0) {
            return 0ll;
        }
        ll b = __lg(n - 1);
        ll ans = self(self, (1LL << b)) + self(self, min(n, 1 + pref[b] / x) - (1LL << b));
        return f[n] = ans;
    };
    f[0] = 0;
    f[1] = 1;
    return solve(solve, 2e18);
}

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 21 / 21
• Subtask 4: 35 / 35
• Subtask 5: 23 / 23