jdkaplan/advent-of-code
Watch
1
0
Fork
You've already forked advent-of-code
 0
Code Issues Activity

2023 Day 22 Part 2

Browse source
This commit is contained in:
Jeremy Kaplan 2024-12-15 20:49:07 -08:00
commit 196c130011
1 changed files with 22 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

25
2023/day22.py
View file

@ -71,7 +71,7 @@ class Snapshot:
return cls(bricks) return cls(bricks)
def part1(snap: Snapshot): def solve(snap: Snapshot) -> tuple[int, int]:
supports: dict[int, set[int]] = defaultdict(lambda: set()) supports: dict[int, set[int]] = defaultdict(lambda: set())
tower: dict[Point, int] = {} tower: dict[Point, int] = {}
bricks: dict[int, Brick] = {} bricks: dict[int, Brick] = {}
@ -154,8 +154,25 @@ def part1(snap: Snapshot):
for v in supports.values(): for v in supports.values():
if len(v) == 1: if len(v) == 1:
solos.add(next(iter(v))) solos.add(next(iter(v)))
part1 = len(snap.bricks) - len(solos)
return len(snap.bricks) - len(solos) part2 = 0
for root in solos:
falling = {root}
changed = True
while changed:
changed = False
for id, support in supports.items():
if id in falling:
continue
if support <= falling:
falling.add(id)
changed = True
part2 += len(falling) - 1
return (part1, part2)
def relpath(path: str) -> str: def relpath(path: str) -> str:
@ -167,4 +184,6 @@ with open(relpath(input_path)) as f:
snap = Snapshot.parse(f.read()) snap = Snapshot.parse(f.read())
print(part1(snap)) part1, part2 = solve(snap)
print(part1)
print(part2)