Submission #1054554

#	Time	Username	Problem	Language	Result	Execution time	Memory
1054554		Gromp15	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	71 ms	856 KiB

biscuits

#include <bits/stdc++.h>
#include "biscuits.h"
#define ll long long
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
using namespace std;

const int N = 2e4;

long long count_tastiness(long long x, std::vector<long long> a) {
	vector<ll> dp(N+1);
	dp[0] = 1;
	for (int i = 0; i < sz(a); i++) {
		vector<ll> dp2(N+1);
		for (int j = 0; j <= N; j++) if (dp[j]) {
			if (j + a[i] >= x) dp2[min<ll>(N, (j + a[i] - x) >> 1)] += dp[j];
			dp2[min<ll>(N, (j + a[i]) >> 1)] += dp[j];
		}
		swap(dp, dp2);
	}
	return accumulate(all(dp), 0LL);
}

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