Submission #675495

#	Time	Username	Problem	Language	Result	Execution time	Memory
675495		VodkaInTheJar	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	32 ms	7948 KiB

biscuits

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define endl '\n'

using namespace std;

map <long long, long long> dp[64];
long long f(int pos, long long pr, long long x, vector <long long> &a) {
    long long sum = pr; 
    if (pos < (int)a.size())
        sum += a[pos];

    if (sum < x && pos >= (int)a.size())
        return 0;

    if (dp[pos].count(pr))
        return dp[pos][pr];

    long long ans = f(pos + 1, sum >> 1ll, x, a);
    if (sum >= x)
        ans += f(pos + 1, (sum - x) >> 1ll, x, a);

    return dp[pos][pr] = ans;
}

long long count_tastiness(long long x, vector <long long> a) {
    return f(0, 0, x, a);
}

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