Submission #787696

#	Time	Username	Problem	Language	Result	Execution time	Memory
787696		raysh07	Packing Biscuits (IOI20_biscuits)	C++17	100 / 100	48 ms	1344 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
 
const int mxk = 60;
 
map<ll, ll> memo;
ll solve(ll n, ll x, vector<ll> &pref) {
    if(n == 1) return 1;
    if(n <= 0) return 0;
    if(memo.count(n)) return memo[n];
    ll val = 0;
    int msb = 63-__builtin_clzll(n-1);
    val += solve(1LL<<msb, x, pref);
    val += solve(min(n, 1+pref[msb]/x)-(1LL<<msb), x, pref);
    memo[n] = val;
    return val;
}
 
 
ll count_tastiness(ll x, vector<ll> a) {
    memo.clear();
    vector<ll> pref(mxk);
    a.resize(mxk, 0);
    for(int i = 0; i < mxk; i++) {
        pref[i] = (1LL<<i)*a[i]+(i?pref[i-1]:0);
    }
    ll ans = solve(1LL<<mxk, x, pref);
	return ans;
}
 

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