bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-25 21:00:31 +01:00
Code Issues Projects Releases Wiki Activity

Reuse IntCodeComputer for part 1.

Browse Source
This commit is contained in:
Bert Peters
2019-12-09 18:33:34 +01:00
parent c0396fb32c
commit a1ef62cd44
1 changed files with 11 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
2019/src/day07.cpp
View File

@@ -7,12 +7,14 @@
namespace {
using aoc2019::IntCodeComputer;
int simulate(const std::vector<int> &program, const std::array<int, 5> &phases) {
int state = 0;
for (int phase : phases) {
auto copy = program;
auto result = aoc2019::run_intcode(copy, {phase, state});
state = result.front();
std::int64_t simulate(const std::vector<std::int64_t> &program, const std::array<std::int64_t, 5> &phases) {
std::int64_t state = 0;
for (auto phase : phases) {
std::deque<std::int64_t> outputs;
IntCodeComputer computer{program, {phase, state}};
computer.connectOutput(outputs);
computer.run();
state = outputs.front();
}
return state;
@@ -41,10 +43,10 @@ namespace {
}
void aoc2019::day07_part1(std::istream &input, std::ostream &output) {
const auto program = aoc2019::read_intcode(input);
std::array<int, 5> phases{0, 1, 2, 3, 4};
const auto program = aoc2019::IntCodeComputer::read_intcode(input);
std::array<std::int64_t, 5> phases{0, 1, 2, 3, 4};
int best = 0;
std::int64_t best = 0;
do {
best = std::max(simulate(program, phases), best);