Submission #605428

#	Time	Username	Problem	Language	Result	Execution time	Memory
605428		HamletPetrosyan	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	42 ms	628 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];

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

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