Submission #1292867

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

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define sz(v) (int)(v).size()

ll count_tastiness(ll x, vector<ll> a) {
	int ans = 0;

	ll sum = 0;
	for (int i=0; i<sz(a); i++) {
		sum += a[i] * (1LL << i);
	}

	set<int> blocked;

	for (int i=0; i<=sum; i++) {
		bool check = true;

		ll mask = 0; ll pf = 0;
		for (int b=0; b<30 and !check; b++) {
			if (b < sz(a)) pf += a[b] * (1 << b);
			if (((1 << b) & i)) {
				mask += (1 << b);
				if (blocked.count(mask)) check = false;
				if (mask * x > pf) check = false;
			}
		}
		// if (check) cerr << bitset<5> (i) << ' ' << i << '\n';

		ans += check;
		if (!check) blocked.insert(i);
	}

	// cout << " ============================= \n";

	return ans;
}

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