Submission #1032265

#	Time	Username	Problem	Language	Result	Execution time	Memory
1032265		mdn2002	Packing Biscuits (IOI20_biscuits)	C++17	21 / 100	1099 ms	63312 KiB

biscuits

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

long long count_tastiness(long long x, vector<long long> a) {
    while (a.size() != 200) a.push_back(0);
    map<long long, long long> dp[202];
    function<long long(int, long long)> f = [&] (int i, long long sum) {
        if (i > 60 && sum == 0) return 1ll;
        if (dp[i].count(sum)) return dp[i][sum];
        long long ans = f(i + 1, (sum + a[i]) / 2);
        if (sum + a[i] >= x) ans += f(i + 1, (sum + a[i] - x) / 2);
        return dp[i][sum] = ans;
    };
    return f(0, 0);
}

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