day25 🔑

Author: rene-d

2024/README.md

@@ -1,11 +1,11 @@
 # Advent of Code in Rust 🦀
 
 ![AoC2024](https://img.shields.io/badge/Advent_of_Code-2024-8A2BE2)
-![Stars: 48](https://img.shields.io/badge/Stars-48⭐-blue)
-![Rust: 25](https://img.shields.io/badge/Rust-25-cyan?logo=Rust)
-![Python: 9](https://img.shields.io/badge/Python-9-cyan?logo=Python)
+![Stars: 50](https://img.shields.io/badge/Stars-50⭐-blue)
+![Rust: 26](https://img.shields.io/badge/Rust-26-cyan?logo=Rust)
+![Python: 10](https://img.shields.io/badge/Python-10-cyan?logo=Python)
 
-## 2024 ([Calendar](https://adventofcode.com/2024)) ([Solutions](../2024/)) : 48⭐
+## 2024 ([Calendar](https://adventofcode.com/2024)) ([Solutions](../2024/)) : 50⭐
 
 Puzzle                                                                 | Stars | Languages
 ---------------------------------------------------------------------- | ----- | -----------
@@ -33,3 +33,4 @@ Puzzle                                                                 | Stars |
 [Day 22: Monkey Market](https://adventofcode.com/2024/day/22)          | ⭐⭐  | [![Rust](../scripts/assets/rust.png)](../2024/day22/day22.rs)
 [Day 23: LAN Party](https://adventofcode.com/2024/day/23)              | ⭐⭐  | [![Rust](../scripts/assets/rust.png)](../2024/day23/day23.rs) [![Python](../scripts/assets/python.png)](../2024/day23/day23.py)
 [Day 24: Crossed Wires](https://adventofcode.com/2024/day/24)          | ⭐⭐  | [![Rust](../scripts/assets/rust.png)](../2024/day24/day24.rs)
+[Day 25: Code Chronicle](https://adventofcode.com/2024/day/25)         | ⭐⭐  | [![Rust](../scripts/assets/rust.png)](../2024/day25/day25.rs) [![Python](../scripts/assets/python.png)](../2024/day25/day25.py) [![Go](../scripts/assets/go.png)](../2024/day25/day25.go)

2024/day25/Cargo.toml

@@ -0,0 +1,11 @@
+[package]
+name = "day25"
+version = "0.1.0"
+edition = "2021"
+
+[dependencies]
+aoc = { path = "../../aoc" }
+
+[[bin]]
+name = "day25"
+path = "day25.rs"

2024/day25/day25.go

@@ -0,0 +1,62 @@
+package main
+
+import (
+	"fmt"
+	"log"
+	"os"
+	"strings"
+)
+
+func main() {
+	filename := "input.txt"
+	if len(os.Args) >= 2 {
+		filename = os.Args[1]
+	}
+	data, err := os.ReadFile(filename)
+	if err != nil {
+		log.Fatal(err)
+	}
+
+	var keys, locks [][]int
+
+	schematicsList := strings.Split(string(data), "\n\n")
+
+	for _, schematics := range schematicsList {
+		lines := strings.Split(schematics, "\n")
+
+		heights := []int{-1, -1, -1, -1, -1}
+		for _, line := range lines {
+			if len(line) == 5 {
+				for x, c := range line {
+					if c == '#' {
+						heights[x]++
+					}
+				}
+			}
+		}
+
+		if lines[0] == "#####" {
+			locks = append(locks, heights)
+		} else {
+			keys = append(keys, heights)
+		}
+	}
+
+	sum := 0
+	for _, lock := range locks {
+		for _, key := range keys {
+			valid := true
+			for i := range key {
+				if key[i]+lock[i] > 5 {
+					valid = false
+					break
+				}
+			}
+			if valid {
+				sum++
+			}
+		}
+	}
+
+	fmt.Println(sum)
+}

2024/day25/day25.py

@@ -0,0 +1,42 @@
+#!/usr/bin/env python3
+# [Day 25: Code Chronicle](https://adventofcode.com/2024/day/25)
+
+
+from argparse import ArgumentParser
+from pathlib import Path
+
+parser = ArgumentParser()
+parser.add_argument("-v", "--verbose", action="store_true")
+parser.add_argument("-t", "--test", action="store_true")
+parser.add_argument("filename", nargs="?", type=Path, default="input.txt")
+args = parser.parse_args()
+if args.test:
+    args.filename = Path("test.txt")
+
+data = args.filename.read_text().strip()
+
+
+keys = []
+locks = []
+
+for schematics in data.split("\n\n"):
+
+    schematics = schematics.splitlines()
+    assert len(schematics) == 7
+
+    heights = [-1, -1, -1, -1, -1]
+    for line in schematics:
+        assert len(line) == 5
+        for x, c in enumerate(line):
+            if c == "#":
+                heights[x] += 1
+
+    if schematics[0] == "#####":
+        locks.append(heights)
+    elif schematics[6] == "#####":
+        keys.append(heights)
+    else:
+        assert False
+
+
+print(sum(all(a + b <= 5 for (a, b) in zip(key, lock)) for lock in locks for key in keys))

2024/day25/day25.rs

@@ -0,0 +1,77 @@
+//! [Day 25: Code Chronicle](https://adventofcode.com/2024/day/25)
+
+struct Puzzle {
+    data: String,
+}
+
+impl Puzzle {
+    const fn new() -> Self {
+        Self {
+            data: String::new(),
+        }
+    }
+
+    /// Get the puzzle input.
+    fn configure(&mut self, path: &str) {
+        self.data = std::fs::read_to_string(path).unwrap_or_else(|_| {
+            eprintln!("cannot read input file {path}");
+            std::process::exit(1);
+        });
+    }
+
+    /// Solve part one.
+    fn part1(&self) -> u32 {
+        let mut locks = Vec::new();
+        let mut keys = Vec::new();
+
+        for schematics in self.data.split("\n\n") {
+            let heights: Vec<_> = (0..5)
+                .map(|x| {
+                    schematics
+                        .lines()
+                        .filter(|row| row.chars().nth(x).unwrap() == '#')
+                        .count()
+                        - 1
+                })
+                .collect();
+
+            if schematics.starts_with("#####") {
+                locks.push(heights);
+            } else {
+                keys.push(heights);
+            }
+        }
+
+        let mut answer = 0;
+
+        for key in &keys {
+            for lock in &locks {
+                if key.iter().zip(lock.iter()).all(|(a, b)| a + b <= 5) {
+                    answer += 1;
+                }
+            }
+        }
+
+        answer
+    }
+}
+
+fn main() {
+    let args = aoc::parse_args();
+    let mut puzzle = Puzzle::new();
+    puzzle.configure(args.path.as_str());
+    println!("{}", puzzle.part1());
+}
+
+/// Test from puzzle input
+#[cfg(test)]
+mod test {
+    use super::*;
+
+    #[test]
+    fn test_part1() {
+        let mut puzzle = Puzzle::new();
+        puzzle.configure("test.txt");
+        assert_eq!(puzzle.part1(), 3);
+    }
+}

2024/day25/test.txt

@@ -0,0 +1,39 @@
+#####
+.####
+.####
+.####
+.#.#.
+.#...
+.....
+
+#####
+##.##
+.#.##
+...##
+...#.
+...#.
+.....
+
+.....
+#....
+#....
+#...#
+#.#.#
+#.###
+#####
+
+.....
+.....
+#.#..
+###..
+###.#
+###.#
+#####
+
+.....
+.....
+.....
+#....
+#.#..
+#.#.#
+#####