Submission #590190

#	Time	Username	Problem	Language	Result	Execution time	Memory
590190		Lucpp	Packing Biscuits (IOI20_biscuits)	C++17	42 / 100	1061 ms	43420 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
const int k = 60;
ll x;
vector<ll> a;
 
vector<unordered_map<ll, ll>> dp;
 
ll calc(int i, ll cnt){
	if(i == k) return 1;
	if(dp[i].count(cnt)) return dp[i][cnt];
	ll ans = 0;
	if(cnt+a[i] >= x){
		ans += calc(i+1, (cnt+a[i]-x)/2);
	}
	ans += calc(i+1, (cnt+a[i])/2);
	return dp[i][cnt] = ans;
}
 
ll count_tastiness(ll x_, vector<ll> a_) {
	x = x_; a = a_;
	a.resize(k);
	for(int i = 0; i < k; i++){
		if(a[i] <= x+1) continue;
		ll cnt = (a[i]-x)/2;
		a[i] -= 2*cnt;
		a[i+1] += cnt;
	}
	dp.clear();
	dp.resize(k);
	return calc(0, 0);
}

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