Submission #468348

#	Time	Username	Problem	Language	Result	Execution time	Memory
468348		kessido	Packing Biscuits (IOI20_biscuits)	C++17	42 / 100	1094 ms	43472 KiB

biscuits

#include <bits/stdc++.h>
using namespace std;

#define pi pair<int, int>
#define ll long long int
#define vll vector<ll>
#define all(x) (x).begin(), (x).end()
#define fori(i,n) for(int i = 0; i < int(n); i++)

ll a[61];
void simplify(ll x, vll&b) {
    fori(i,61) a[i] = 0;
    fori(i, b.size()) a[i] = b[i];

    ll extra = 0;
    for(ll &i : a) {
        extra += i;
        i = min(x, extra);
        extra -= i;
        if(extra&1) i++;
        extra /= 2;
    }
}

unordered_map<ll, ll> dp[60];
ll recurse(const int index,const ll x) {
    if(index >= 60) return 1;
    if(dp[index].count(a[index])) return dp[index][a[index]];

    ll ans = 0;

    ll extra = a[index] / 2;
    a[index+1] += extra;
    ans += recurse(index+1, x);
    a[index+1] -= extra;

    if(a[index] >= x) {
        extra = (a[index] - x) / 2;
        a[index+1] += extra;
        ans += recurse(index+1, x);
        a[index+1] -= extra;
    }

    return dp[index][a[index]] = ans;
}

ll count_tastiness(ll x, vll a) {
    simplify(x, a);
    fori(i,60) dp[i].clear();
    return recurse(0, x);
}

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