Submission #1292771

#	Time	Username	Problem	Language	Result	Execution time	Memory
1292771		Sofiatpc	Packing Biscuits (IOI20_biscuits)	C++20	0 / 100	1 ms	572 KiB

biscuits

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

using namespace std;

const int MAXK = 65;
long long dp[2][MAXK];

long long count_tastiness(long long x, vector<long long> a) {
	
	for(int i = 0; i < a.size(); i++){
		if(a[i] > 2){
			if(a.size() == i+1)a.push_back(0);
			a[i+1] += (a[i]-1)/2;
			a[i] -= ((a[i]-1)/2)*2;
		}
		if(a[i] == 2 && a.size() == i+1)a.push_back(0);
	}

	int k = a.size();
	dp[0][k-1] = 1; dp[1][k-1] = 1;
	for(int i = k-2; i >= 0; i--){
		dp[0][i] = dp[0][i+1];
		if(a[i+1] >= 1 || a[i] == 2)dp[0][i] += dp[1][i+1];

		dp[1][i] = dp[0][i+1];
		if(a[i+1] >= 1)dp[1][i] += dp[1][i+1];
	}

	long long ans = dp[0][0];
	if(a[0] >= 1)ans += dp[1][0];

	return ans;
}

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