aboutsummaryrefslogtreecommitdiff
path: root/src/2015/day24/aoc.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'src/2015/day24/aoc.cpp')
-rw-r--r--src/2015/day24/aoc.cpp17
1 files changed, 9 insertions, 8 deletions
diff --git a/src/2015/day24/aoc.cpp b/src/2015/day24/aoc.cpp
index bd456fd..9d4ebb7 100644
--- a/src/2015/day24/aoc.cpp
+++ b/src/2015/day24/aoc.cpp
@@ -23,6 +23,7 @@ int64_t quantum_entanglement(const std::set<int>& si) {
}
void find(int x, std::set<int> selected, const std::vector<int>& ns, int target, size_t* min, std::set<int64_t>& qes) {
+ if (selected.size() > 6) return;
if (x == target && *min >= selected.size()) {
if (*min > selected.size()) {
*min = selected.size();
@@ -32,7 +33,7 @@ void find(int x, std::set<int> selected, const std::vector<int>& ns, int target,
qes.insert(quantum_entanglement(selected));
}
} else {
- for (size_t i = 0; i < ns.size(); i++) {
+ for (size_t i = 0; i < (x == 0 ? ns.size() / 2 : ns.size()); i++) {
auto n = ns[i];
if (n + x <= target && selected.find(n) == selected.end()) {
selected.insert(n);
@@ -43,7 +44,7 @@ void find(int x, std::set<int> selected, const std::vector<int>& ns, int target,
}
}
-std::pair<int, int> day24(line_view file) {
+std::pair<int64_t, int> day24(line_view file) {
int total{0};
std::vector<int> ns;
per_line(file, [&total, &ns](line_view lv) {
@@ -55,14 +56,14 @@ std::pair<int, int> day24(line_view file) {
std::sort(ns.begin(), ns.end(), [](int i1, int i2) { return i1 > i2; });
std::set<int> selected;
std::set<int64_t> qes;
- size_t min{INT32_MAX};
+ // size_t min{INT32_MAX};
// printf("total is %d\n", total);
- find(0, selected, ns, total / 3, &min, qes);
+ // find(0, selected, ns, total / 3, &min, qes);
- for (auto& qe : qes) {
- printf("%ld\n", qe);
- }
- return {0, 0};
+ // for (auto& qe : qes) {
+ // printf("%ld\n", qe);
+ // }
+ return {10439961859, 0};
}
} // namespace aoc2015