Submission #833850

#	Time	Username	Problem	Language	Result	Execution time	Memory
833850		Johann	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	1169 ms	1981964 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()

int X;
ll ans = 0;
void dfs(int idx, vi &a)
{
	if (idx == sz(a) - 1 && a[idx] < X)
		return;
	if (idx + 1 >= sz(a))
		a.push_back(0);
	ll oldidxplus1 = a[idx + 1];

	if (a[idx] >= X)
	{
		++ans;
		a[idx + 1] += (a[idx] - X) / 2;
		dfs(idx + 1, a);
	}
	a[idx + 1] = oldidxplus1;
	a[idx + 1] += a[idx] / 2;
	dfs(idx + 1, a);
	a[idx + 1] = oldidxplus1;
}
long long count_tastiness(long long _X, std::vector<long long> a)
{
	X = _X;
	a.push_back(0);
	ans = 0;
	dfs(0, a);

	return ans + 1;
}

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