ollien/advent-of-code-2019
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Add solution to day 23 part 2

Browse source
This commit is contained in:
Nick Krichevsky 2019-12-25 00:24:47 -05:00
parent 26291ea0de
commit 9c67c89829
1 changed files with 18 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
day23/py/main.py
View file

@ -232,10 +232,20 @@ def group_iter(n: int, iterable: Iterable[T]) -> Iterable[Tuple[T, T, T]]:
return itertools.zip_longest(*args) return itertools.zip_longest(*args)
def part1(initial_memory_state: Memory) -> int: def run(initial_memory_state: Memory, part2=False) -> int:
computers = [Computer(initial_memory_state) for i in range(50)] computers = [Computer(initial_memory_state) for i in range(50)]
nat_packet = None
last_nat_packet = None
while True: while True:
if nat_packet is not None and all(len(computer.to_send) == 0 for computer in computers):
if nat_packet == last_nat_packet:
return nat_packet[1]
computers[0].queue_send(nat_packet)
last_nat_packet = nat_packet
nat_packet = None
for address, computer in enumerate(computers): for address, computer in enumerate(computers):
computer_input = None if computer.booted else address computer_input = None if computer.booted else address
if not computer.booted: if not computer.booted:
@ -247,8 +257,11 @@ def part1(initial_memory_state: Memory) -> int:
for output in outputs: for output in outputs:
send_address, x, y = output send_address, x, y = output
if send_address == 255: if send_address == 255 and part2:
nat_packet = (x, y)
elif send_address == 255 and not part2:
return y return y
else:
computers[send_address].queue_send((x, y)) computers[send_address].queue_send((x, y))
@ -262,4 +275,5 @@ if __name__ == "__main__":
for i, item in enumerate(f.read().rstrip().split(",")): for i, item in enumerate(f.read().rstrip().split(",")):
memory[i] = int(item) memory[i] = int(item)
print(part1(memory)) print(run(memory, False))
print(run(memory, True))