Submission #490279

#	Time	Username	Problem	Language	Result	Execution time	Memory
490279		mraron	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	1085 ms	20604 KiB

biscuits

#include "biscuits.h"
#include <map>
using namespace std;

using ll = long long ;

ll x;
vector<ll> a;
map<pair<ll,ll>, ll> dp;

ll calc(ll rem, ll i) {
	if(dp.count(make_pair(rem, i))) return dp[{rem,i}];
	if(i<(int)a.size() || rem>=x) {
		if(i<(int)a.size()) rem+=a[i];
		return dp[{rem,i}]=(rem>=x?calc((rem-x)/2, i+1):0ll)+calc(rem/2, i+1);
	}else return 1;
}	

ll count_tastiness(ll x_, vector<ll> a_) {
	a=move(a_);
	x=x_;
	dp.clear();
	
	return calc(0, 0);
}

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