Submission #1046671

#	Time	Username	Problem	Language	Result	Execution time	Memory
1046671		mariaclara	Packing Biscuits (IOI20_biscuits)	C++17	42 / 100	176 ms	47196 KiB

biscuits

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

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

ll count_tastiness(ll x, vector<ll> a) {
	int n = 60;
	ll sum = 0;
	while(sz(a) < 60) a.pb(0);

	for(int i = 0; i < n; i++) sum += a[i] * (1LL<<i);


	for(int i = 0; i < n-1; i++) {
		if(a[i] < x) continue;
		a[i+1] += (a[i] - x)/2;
		a[i] = x + ((a[i] - x)%2);
	}
	a[n-1] = min(a[n-1], x);

	// for(int i = 0; i < n; i++) cout << a[i] << " ";
	// cout << endl;

	vector<ll> dp[n+1];
	if(min(x,sum) > 1e5) return 0;

	for(int i = 0; i <= n; i++) dp[i].resize(min(x, sum) + 1);

	dp[0][0] = 1;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < sz(dp[i]); j++) {
			// dp[i][j] = guarda quantos números eu posso formar
			dp[i+1][(j+a[i])/2] += dp[i][j];
			if(j+a[i] >= x) dp[i+1][(j+a[i]-x)/2]  += dp[i][j];
		}
	}

	ll ans = 0;
	for(int j = 0; j < sz(dp[n]); j++) ans += dp[n][j];

	return ans;
}

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