Submission #1014902

#	Time	Username	Problem	Language	Result	Execution time	Memory
1014902		Unforgettablepl	Packing Biscuits (IOI20_biscuits)	C++17	9 / 100	1070 ms	227804 KiB

biscuits

#include <bits/stdc++.h>
using namespace std;
 
const int LIMIT = 25;
 
long long count_tastiness(long long x, std::vector<long long> a) {
	map<pair<int,int>,long long> memo;
	function<long long(long long,long long)> calc = [&](long long i,long long j){
		j=max(j,0ll);
		if(i==-1)return j==0 ? 1ll : 0ll;
		if(j>(((long long)1e18)/(1ll<<i)))return 0ll;
		if(memo.count({i,j}))return memo[{i,j}];
		long long ac = calc(i-1,2ll*(j-a[i]));
		if(ac>0)return memo[{i,j}] = calc(i-1,2ll*(j-a[i]+x))+ac;
		else return memo[{i,j}]=0ll;
	};
	a.resize(LIMIT+1);
	return calc(LIMIT,0);
}

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