Submission #834668

#	Time	Username	Problem	Language	Result	Execution time	Memory
834668		Johann	Packing Biscuits (IOI20_biscuits)	C++14	44 / 100	150 ms	3540 KiB

biscuits

#include "biscuits.h"
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

ll X;
ll A[200200];

long long count_tastiness(long long _X, std::vector<long long> a)
{
	X = _X;
	vector<ll> S(sz(a) + 1, 0);
	ll base = 1;
	for (int i = 0; i < sz(a); ++i)
	{
		S[i] += a[i] * base;
		S[i + 1] += S[i];
		base *= 2;
	}

	ll ans = 1;
	A[0] = 0;
	base = 1;
	for (int i = 0; base * X <= S.back(); ++i)
	{
		ll size = ans;
		ll bound = (i < sz(S)) ? S[i] : S.back();
		for (int j = 0; j < size; ++j)
		{
			ll y = A[j];
			if ((y + base) * X <= bound)
				A[ans++] = y + base;
			else
				break;
		}
		base *= 2;
	}

	return ans;
}

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