Submission #490290

#	Time	Username	Problem	Language	Result	Execution time	Memory
490290		mraron	Packing Biscuits (IOI20_biscuits)	C++14	21 / 100	1093 ms	55744 KiB

biscuits

#include "biscuits.h"
#include <iostream>
#include <unordered_map>
#include <map>
#include <utility>
#include <functional>
#include <cassert>
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({rem, i})) return dp[{rem, i}];
	ll orig=rem;
	
	if(i<(int)a.size() || rem>=x) {
		if(i<(int)a.size()) rem+=a[i];
		
		ll ans=calc(rem/2, i+1);
		if(rem>=x) {
			ans+=calc((rem-x)/2, i+1);
		}
		
		return dp[{orig, i}]=ans;
	}else return 1;
}	

ll count_tastiness(ll x_, vector<ll> a_) {
	a=a_;
	x=x_;

	a.resize(60);
	for(int i=0;i<60;++i) {
		if(a[i]>=x+2) {
			ll diff=a[i]-(x+1);
			a[i]-=(diff+1)/2*2;
			a[i+1]+=(diff+1)/2;
		}
	}
	
	dp.clear();
	
	//~ for(auto i:a) std::cerr<<i<<" ";
	//~ cerr<<"\n";

	ll res=calc(0, 0);
	//~ for(auto i:dp) cerr<<"{"<<i.first.first<<";"<<i.first.second<<"} -> "<<i.second<<"\n";
	
	return res;
}

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