Submission #1206009

#TimeUsernameProblemLanguageResultExecution timeMemory
1206009bangan비스킷 담기 (IOI20_biscuits)C++20
0 / 100
1095 ms63348 KiB
#include "biscuits.h"
#include <bits/stdc++.h>

using i64 = long long;

long long count_tastiness(long long x, std::vector<long long> a) {
	int k = a.size();

	std::map<std::pair<int, i64>, i64> save;

	auto f = [&](auto self, int i, i64 n) -> i64 {
		if (save.find(std::make_pair(i, n)) != save.end()) {
			return save[std::make_pair(i, n)];
		}

		i64 cur = n;
		if (i < k) {
			cur += a[i];
		}

		if (cur == 0) {
			return 1;
		}

		i64 res = self(self, i + 1, cur / 2);
		if (cur >= x) {
			res += self(self, i + 1, (cur - x) / 2);
		}
		return save[std::make_pair(i, n)] = res;
	};

	return f(f, 0, 0);
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...