67 lines
1.7 KiB
C++
67 lines
1.7 KiB
C++
#include <algorithm>
|
|
#include <concepts>
|
|
#include <iostream>
|
|
#include <optional>
|
|
#include <utility>
|
|
#include <vector>
|
|
|
|
#include <intcode.hpp>
|
|
using namespace intcode;
|
|
|
|
namespace {
|
|
|
|
template <class R> auto Controller(Machine machine, R const ¶ms) {
|
|
std::vector<Machine> amps;
|
|
for (auto p : params) {
|
|
auto m = machine;
|
|
std::get<Input>(m.Step()).pos = p;
|
|
amps.push_back(std::move(m));
|
|
}
|
|
return amps;
|
|
}
|
|
|
|
template <class R>
|
|
auto Feed(R &&s, ValueType start) -> std::optional<ValueType> {
|
|
for (auto &m : amps) {
|
|
auto i = m.step();
|
|
if (auto p = std::get_if<Input>(&i)) {
|
|
p->pos = start;
|
|
start = std::get<Output>(m.step()).val;
|
|
} else {
|
|
return {};
|
|
}
|
|
}
|
|
return {start};
|
|
}
|
|
|
|
auto compute1(Machine machine, std::vector<ValueType> const ¶ms)
|
|
-> ValueType {
|
|
return *Feed(Controller(std::move(machine), params), 0);
|
|
}
|
|
auto compute2(Machine machine, std::vector<ValueType> const ¶ms)
|
|
-> ValueType {
|
|
auto amps = Controller(std::move(machine), params);
|
|
ValueType last = 0;
|
|
while (auto next = Feed(amps, last)) {
|
|
last = *next;
|
|
}
|
|
return last;
|
|
}
|
|
|
|
template <std::invocable<Machine, std::vector<ValueType> const &> F>
|
|
auto optimize(Machine machine, std::vector<ValueType> params, F f) {
|
|
ValueType best = 0;
|
|
do {
|
|
best = std::max(best, f(machine, params));
|
|
} while (std::next_permutation(params.begin(), params.end()));
|
|
return best;
|
|
}
|
|
|
|
} // namespace
|
|
|
|
auto main() -> int {
|
|
auto machine = Machine{ParseStream(std::cin)};
|
|
std::cout << "Part 1: " << optimize(machine, {0, 1, 2, 3, 4}, compute1) << std::endl;
|
|
std::cout << "Part 2: " << optimize(std::move(machine), {5, 6, 7, 8, 9}, compute2) << std::endl;
|
|
}
|