2024 Day 25 Complete - 500 stars

Author: pcorliss

2024/25/daily.py

@@ -0,0 +1,83 @@
+import itertools
+import sys
+
+def parse(input_text):
+  locks = []
+  keys = []
+
+  working_lock_key = []
+  for line in input_text.strip().split('\n'):
+    if not line:
+      if working_lock_key:
+        if working_lock_key[0][0] == '.':
+          keys.append(working_lock_key)
+        else:
+          locks.append(working_lock_key)
+        working_lock_key = []
+      continue
+
+    working_lock_key.append(list(line))
+
+  if working_lock_key[0][0] == '.':
+    keys.append(working_lock_key)
+  else:
+    locks.append(working_lock_key)
+  return locks, keys
+
+def pin_heights(lock_or_key):
+  print(lock_or_key)
+  lock_range = range(1, len(lock_or_key))
+  key = False
+
+  # It's a key, read backwards and skip the first element
+  if lock_or_key[0][0] == '.':
+      key = True
+      lock_range = range(len(lock_or_key) - 1, 0, -1)
+
+  pin_heights = [0] * len(lock_or_key[0])
+  for i in lock_range:
+    print(f"Row: {i} - {lock_or_key[i]}")
+    for j in range(len(lock_or_key[i])):
+      if lock_or_key[i][j] == '#':
+        if key:
+          pin_heights[j] = len(lock_or_key) - i - 1
+        else:
+          pin_heights[j] = i
+
+  return pin_heights
+
+def overlap(lock, key):
+  # zip lock and key together
+  for l, k in zip(lock, key):
+    if l + k > 5:
+      return True
+    
+  return False
+
+def part1(input_text):
+  locks, keys = parse(input_text)
+
+  lock_pins = []
+  for l in locks:
+    lock_pins.append(pin_heights(l))
+
+  key_pins = []
+  for k in keys:
+    key_pins.append(pin_heights(k))
+
+  counter = 0
+  for l, k in itertools.product(lock_pins, key_pins):
+    if not overlap(l, k):
+      counter += 1
+
+  return counter
+
+def part2(input_text):
+  return 0
+
+if __name__ == "__main__":
+  with open(__file__.rsplit('/', 1)[0] + "/input.txt", 'r') as file:
+    print(part1(file.read()))
+
+  with open(__file__.rsplit('/', 1)[0] + "/input.txt", 'r') as file:
+    print(part2(file.read()))

2024/25/daily_test.py

@@ -0,0 +1,82 @@
+import pytest
+from daily import *
+
+@pytest.fixture
+def sample_data():
+  return """
+#####
+.####
+.####
+.####
+.#.#.
+.#...
+.....
+
+#####
+##.##
+.#.##
+...##
+...#.
+...#.
+.....
+
+.....
+#....
+#....
+#...#
+#.#.#
+#.###
+#####
+
+.....
+.....
+#.#..
+###..
+###.#
+###.#
+#####
+
+.....
+.....
+.....
+#....
+#.#..
+#.#.#
+#####
+"""
+
+@pytest.fixture
+def parsed_data(sample_data):
+  return parse(sample_data)
+
+def test_parse(sample_data):
+  locks, keys = parse(sample_data)
+
+  assert len(locks) == 2
+  assert len(keys) == 3
+
+def test_pin_heights(parsed_data):
+  locks, keys = parsed_data
+
+  assert pin_heights(locks[0]) == [0,5,3,4,3]
+  assert pin_heights(locks[1]) == [1,2,0,5,3]
+  assert pin_heights(keys[0]) == [5,0,2,1,3]
+  assert pin_heights(keys[1]) == [4,3,4,0,2]
+  assert pin_heights(keys[2]) == [3,0,2,0,1]
+
+def test_overlap(parsed_data):
+  locks, keys = parsed_data
+
+  assert overlap(pin_heights(locks[0]), pin_heights(keys[0]))
+  assert overlap(pin_heights(locks[0]), pin_heights(keys[1]))
+  assert overlap(pin_heights(locks[1]), pin_heights(keys[0]))
+
+  assert not overlap(pin_heights(locks[0]), pin_heights(keys[2]))
+  assert not overlap(pin_heights(locks[1]), pin_heights(keys[1]))
+  assert not overlap(pin_heights(locks[1]), pin_heights(keys[2]))
+
+def test_part1(sample_data):
+  assert part1(sample_data) == 3
+
+# def test_part2(sample_data):
+#   assert part2(sample_data) == 81