Submission #921355

#	Time	Username	Problem	Language	Result	Execution time	Memory
921355		ksujay2	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1092 ms	198244 KiB

biscuits

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

ll count_tastiness(ll x, vector<ll> a) {
    int k = a.size();
    map<pair<int, ll>, ll> memo;
    function<ll(int, ll)> f = [&] (int i, ll y) {
        if(i < 0) return (ll)(y == 0);
        if(memo.count({i, y})) return memo[{i, y}];
        y = y - a[i] * (1LL << i);
        memo[{i, y}] = f(i - 1, max(0ll, y)) + f(i - 1, max(0ll, y + x * (1LL << i)));
        return memo[{i, y}];
    };
    return f(k - 1, 0);
}

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