제출 #303865

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
303865		tutis	Packing Biscuits (IOI20_biscuits)	C++17	42 / 100	1080 ms	19920 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
ll count_tastiness(ll x, vector<ll> a)
{
	while (a.size() <= 60)
		a.push_back(0);
	ll s[61];
	s[60] = 0;
	for (int i = 59; i >= 0; i--)
	{
		s[i] = a[i] + s[i + 1] * 2;
		if (s[i] >= 3 * x)
			s[i] = 3 * x;
	}
	cc_hash_table<ll, ll>M[61];
	function<ll(ll, int)>get = [&](ll d, int i)->ll
	{
		if (i == 60)
			return d / x + 1;
		bool ok = false;
		ll sum = d * 2;
		for (int j = i; j < 60; j++)
		{
			sum /= 2;
			sum += a[j];
			if (sum >= x)
			{
				ok = true;
				break;
			}
		}
		if (!ok)
			return 1;
		if (M[i].find(d) != M[i].end())
			return M[i][d];
		if (a[i] + d < x)
		{
			return M[i][d] = get((d + a[i]) / 2, i + 1);
		}
		else
		{
			return M[i][d] = get((d + a[i]) / 2, i + 1) + get((d + a[i] - x) / 2, i + 1);
		}
	};
	return get(0, 0);
}

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