Submission #1292685

#	Time	Username	Problem	Language	Result	Execution time	Memory
1292685		julia_08	Packing Biscuits (IOI20_biscuits)	C++20	0 / 100	1095 ms	568 KiB

biscuits

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

using ll = long long;

using namespace std;

const int MAXN = 70;

ll a[MAXN], pot[MAXN];

int k;

ll bt(int pos, ll x){

	if(a[pos] == 0) return 1;

	ll ans = 0;

	if(a[pos] >= x){

		ll cnt = (a[pos] - x) / 2;
		a[pos + 1] += cnt;

		ans += bt(pos + 1, x);
		a[pos + 1] -= cnt;

	}

	ll cnt = a[pos] / 2;

	a[pos + 1] += cnt;

	ans += bt(pos + 1, x);
	a[pos + 1] -= cnt;

	return ans;

}

ll count_tastiness(ll x, vector<ll> a_){

	k = (int) a_.size();

	for(int i=0; i<64; i++) a[i] = 0;

	for(int i=0; i<k; i++) a[i] = a_[i];

	return bt(0, x);

}

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