Submission #303372

#	Time	Username	Problem	Language	Result	Execution time	Memory
303372		Elegia	Packing Biscuits (IOI20_biscuits)	C++17	42 / 100	1049 ms	41744 KiB

biscuits

#include "biscuits.h"

#include <functional>
#include <unordered_map>

using namespace std;

using ll = long long;

ll count_tastiness(ll x, vector<ll> a) {
	vector<unordered_map<ll, ll>> dp(61);
	a.resize(61);
	for (int i = 0; i < 60; ++i)
		if (a[i] >= x) {
			ll tak = (a[i] - x) / x / 2;
			a[i + 1] += tak * x;
			a[i] -= tak * 2 * x;
		}
	function<ll(int, ll)> dfs = [&](int k, ll v) {
		if (k == 60) return 1LL;
		if (dp[k].count(v))
			return dp[k][v];
		ll ret = dfs(k + 1, (v + a[k]) / 2);
		if (v + a[k] >= x) ret += dfs(k + 1, (v + a[k] - x) / 2);
		return dp[k][v] = ret;
	};
	return dfs(0, 0);
}

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