Submission #666943

#	Time	Username	Problem	Language	Result	Execution time	Memory
666943		djs100201	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	2 ms	1016 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>

using namespace std;
using ll = long long;
map<pair<ll, ll>, ll>mp;
vector<ll>pre;
ll f(ll x, ll y) {
	if (y < 0)return 0;
	if (x == -1)return y + 1;
	if (mp.find({ x,y }) != mp.end())return mp[{x, y}];
	ll ret = f(x - 1, min({ pre[x],(1ll << x) - 1,y }));
	ret += f(x - 1, min({ pre[x] - (1ll << x),(1ll << x) - 1,y - (1ll << x) }));
	return mp[{x, y}] = ret;
}
long long count_tastiness(long long x, vector<long long> A) {
	ll k = A.size(), sum = 0;
	for (ll i = 0; i < k; i++) {
		sum += (A[i] << i);
		pre.push_back(sum / x);
	}
	for (int i = k; i <= 59; i++)pre.push_back(sum/x);
	return f(59, (1ll << 60) - 1);
}

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