Submission #1013389

#	Time	Username	Problem	Language	Result	Execution time	Memory
1013389		ifateen	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1071 ms	604 KiB

biscuits

#include "biscuits.h"
#include <iostream>
const int MAX = 1e5;
long long count_tastiness(long long x, std::vector<long long> a) {
	if (x > MAX) return 1;
	int n = std::min(19, (int)a.size());
	long long ans = 1, sm = 0;
	for (int i = 0; i < n; ++i) sm += a[i] * (1 << i);
	auto works = [&](int count) -> bool {
		std::vector<long long> cur = a;
		for (int i = n - 1; i >= 0; --i) {
			if (count & (1 << i)) {
				long long tmp = x;
				int j = i, need = 1;
				while (tmp) {
					if (cur[j] < need) {
						j--;
						if (j < 0) return false;
						need <<= 1;
					} else {
						--tmp;
						cur[j] -= need;
					}
				}
			} else continue;
		}
		return true;
	};
	for (int count = 1; count * x <= sm; ++count) {
		ans += works(count);
	}
	return ans;
}

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