Submission #416522

#	Time	Username	Problem	Language	Result	Execution time	Memory
416522		SuhaibSawalha1	Packing Biscuits (IOI20_biscuits)	C++17	21 / 100	1087 ms	63300 KiB

biscuits

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

vector<long long> a;
long long x;
map<long long, long long> dp[60];

long long calc (int i = 0, long long hv = 0) {
	if (i == 60) {
		return 1;
	}
	hv = (hv / 2) + a[i];
	if (dp[i].count(hv)) {
		return dp[i][hv];
	}
	long long ret = calc(i + 1, hv);
	if (hv >= x) {
		ret += calc(i + 1, hv - x);
	}
	return dp[i][hv] = ret;
}

long long count_tastiness(long long x, vector<long long> t) {
	::a = t;
	::x = x;
	for (int i = 0; i < 60; ++i) {
		dp[i].clear();
	}
	while (a.size() < 60) {
		a.push_back(0);
	}
	return calc();
}

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