Submission #605437

#	Time	Username	Problem	Language	Result	Execution time	Memory
605437		HamletPetrosyan	Packing Biscuits (IOI20_biscuits)	C++17	42 / 100	1089 ms	72592 KiB

biscuits

#include "biscuits.h"
#include <iostream>
#include <map>
using namespace std;

#define ll long long
#define add push_back
#define len(a) ((int)(a).size())
#define fr first
#define sc second

long long count_tastiness(long long x, vector<long long> a) {
	map<ll, ll> dp[70];

	for(int i = len(a); i < 66; i++){
		a.add(0);
	}

	dp[0][0] = 1;
	for(int i = 0; i < len(a); i++){
		for(auto v : dp[i]){
			dp[i + 1][((v.fr + a[i]) / 2)] += v.sc;
			if(a[i] + v.fr >= x) dp[i + 1][(v.fr + a[i] - x) / 2] += v.sc;
		}
	}
	return dp[len(a)][0];
}

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