제출 #419600

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
419600		KoD	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1094 ms	63196 KiB

biscuits

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

using ll = long long;
template <class T> using Vec = std::vector<T>;
template <class T, class U> using HashTable = __gnu_pbds::gp_hash_table<T, U>;

template <class F> struct RecLambda: private F {
	explicit RecLambda(F&& f): F(std::forward<F>(f)) {}
	template <class... Args> decltype(auto) operator() (Args&&... args) const {
		return F::operator()(*this, std::forward<Args>(args)...);
	}	
};

ll count_tastiness(ll x, Vec<ll> a) {
	std::array<std::map<ll, ll>, 60> table;
	a.resize(60);
	return RecLambda([&](auto&& dfs, const int k, ll s) -> ll {
		if (k == 60) return 0;
		if (table[k].find(s) != table[k].end()) {
			return table[k][s];
		}
		// std::cerr << k << ' ' << s << std::endl;
		s += a[k];
		ll ret = dfs(k + 1, s / 2);
		if (s >= x) {
			ret += 1 + dfs(k + 1, (s - x) / 2);
		}
		return table[k][s] = ret;
	})(0, 0) + 1;
}

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