Submission #1014813

#TimeUsernameProblemLanguageResultExecution timeMemory
1014813UnforgettableplPacking Biscuits (IOI20_biscuits)C++17
0 / 100
1109 ms231692 KiB
#include <bits/stdc++.h>
using namespace std;

long long count_tastiness(long long x, std::vector<long long> a) {
	map<pair<int,int>,long long> memo;
	function<long long(int,int)> calc = [&](int i,int j){
		j=max(j,0);
		if(memo.count({i,j}))return memo[{i,j}];
		if(i==-1)return j==0 ? 1ll : 0ll;
		long long ac = calc(i-1,2*(j-a[i]));
		if(ac>0)return memo[{i,j}] = calc(i-1,2*(j-a[i]+x))+ac;
		else return 0ll;
	};
	return calc(a.size()-1,0);
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...