Submission #838515

#	Time	Username	Problem	Language	Result	Execution time	Memory
838515		caganyanmaz	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	862 ms	2097152 KiB

biscuits

#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define int long long
using namespace std;

//#define DEBUGGING
#ifdef DEBUGGING
#include "../debug.h"
#else
#define debug(x...) void(42)
#endif


constexpr static int MXK = 62;
ll count_tastiness(ll x, vector<ll> a) 
{
	int limiter;
	if (x <= 1e4)
		limiter = 1e18;
	else
		limiter = 2e5;
	while (a.size() < MXK-1)
		a.pb(0);

	for (int i = 0; i < MXK-2; i++)
	{
		ll change = max<ll>((a[i] - x) / 2, 0);
		a[i+1] += change;
		a[i] -= change * 2;
	}
	vector<ll> pf(MXK, 0);
	for (int i = 1; i < MXK; i++)
		pf[i] = pf[i-1]  + (a[i-1] << (i-1));
	vector<vector<ll>> dp(MXK, vector<ll>(x+3, 0)); // Last open bit
	dp[0][0] = 1;
	for (int i = 1; i < MXK; i++)
		for (int j = 0; j < i; j++)
			for (int k = 0; k < min<int>(limiter/(1<<(i-1)), x+3); k++)
				if (((pf[i] - pf[j] + (k<<(j-1)))>>(i-1)) >= x)
					dp[i][((pf[i]-pf[j]+(k<<(j-1)))>>(i-1))-x] += dp[j][k];
	ll res = 0;
	for (int i = 0; i < MXK; i++)
		for (int j = 0; j < x + 3; j++)
			res += dp[i][j];
	debug(dp, res);
	return res;
}

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