day01

Cargo.toml

@@ -4,3 +4,4 @@ version = "0.1.0"
 edition = "2024"
 
 [dependencies]
+clap = "4.5.23"

src/day01/README.md

@@ -0,0 +1,42 @@
+# --- Day 1: Historian Hysteria ---
+The Chief Historian is always present for the big Christmas sleigh launch, but nobody has seen him in months! Last anyone heard, he was visiting locations that are historically significant to the North Pole; a group of Senior Historians has asked you to accompany them as they check the places they think he was most likely to visit.
+
+As each location is checked, they will mark it on their list with a **star**. They figure the Chief Historian **must** be in one of the first fifty places they'll look, so in order to save Christmas, you need to help them get **fifty stars** on their list before Santa takes off on December 25th.
+
+Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants **one star**. Good luck!
+
+You haven't even left yet and the group of Elvish Senior Historians has already hit a problem: their list of locations to check is currently **empty**. Eventually, someone decides that the best place to check first would be the Chief Historian's office.
+
+Upon pouring into the office, everyone confirms that the Chief Historian is indeed nowhere to be found. Instead, the Elves discover an assortment of notes and lists of historically significant locations! This seems to be the planning the Chief Historian was doing before he left. Perhaps these notes can be used to determine which locations to search?
+
+Throughout the Chief's office, the historically significant locations are listed not by name but by a unique number called the **location ID**. To make sure they don't miss anything, The Historians split into two groups, each searching the office and trying to create their own complete list of location IDs.
+
+There's just one problem: by holding the two lists up **side by side** (your puzzle input), it quickly becomes clear that the lists aren't very similar. Maybe you can help The Historians reconcile their lists?
+
+For example:
+
+```
+3   4
+4   3
+2   5
+1   3
+3   9
+3   3
+```
+
+Maybe the lists are only off by a small amount! To find out, pair up the numbers and measure how far apart they are. Pair up the **smallest number in the left list** with the **smallest number in the right list**, then the **second-smallest left number** with the **second-smallest right number**, and so on.
+
+Within each pair, figure out **how far apart** the two numbers are; you'll need to **add up all of those distances**. For example, if you pair up a `3` from the left list with a `7` from the right list, the distance apart is `4`; if you pair up a `9` with a `3`, the distance apart is `6`.
+
+In the example list above, the pairs and distances would be as follows:
+
+- The smallest number in the left list is `1`, and the smallest number in the right list is `3`. The distance between them is `2`.
+- The second-smallest number in the left list is `2`, and the second-smallest number in the right list is another `3`. The distance between them is `1`.
+- The third-smallest number in both lists is `3`, so the distance between them is `0`.
+- The next numbers to pair up are `3` and `4`, a distance of `1`.
+- The fifth-smallest numbers in each list are `3` and `5`, a distance of `2`.
+- Finally, the largest number in the left list is `4`, while the largest number in the right list is `9`; these are a distance `5` apart.
+
+To find the **total distance** between the left list and the right list, add up the distances between all of the pairs you found. In the example above, this is `2 + 1 + 0 + 1 + 2 + 5`, a total distance of `11`!
+
+Your actual left and right lists contain many location IDs. **What is the total distance between your lists?**

src/day01/mod.rs

@@ -0,0 +1,79 @@
+use std::{error::Error, fs};
+
+fn calculate_distance(array_one: &mut [i32], array_two: &mut [i32]) -> i32 {
+    array_one.sort_unstable();
+    array_two.sort_unstable();
+
+    array_one
+        .iter()
+        .zip(array_two.iter())
+        .map(|(a, b)| if a > b { a - b } else { b - a })
+        .sum()
+}
+
+#[allow(clippy::cast_possible_truncation, clippy::cast_possible_wrap)]
+fn calculate_score(array_one: &mut [i32], array_two: &mut [i32]) -> i32 {
+    array_one.sort_unstable();
+    array_two.sort_unstable();
+
+    array_one
+        .iter()
+        .map(|i| i * (array_two.iter().filter(|&j| i == j).count() as i32))
+        .sum()
+}
+
+/// Solves the problem for day 01.
+///
+/// # Errors
+///
+/// This function will return an error if the file cannot be read or if the input is invalid.
+pub fn solve_day01(path: &str) -> Result<(i32, i32), Box<dyn Error>> {
+    let content = fs::read_to_string(path)?;
+
+    let mut array_one = Vec::new();
+    let mut array_two = Vec::new();
+    for line in content.split('\n') {
+        let parts: Vec<&str> = line.split_whitespace().collect();
+        if parts.len() == 2 {
+            let a = parts[0];
+            let b = parts[1];
+            array_one.push(a.trim().parse()?);
+            array_two.push(b.trim().parse()?);
+        }
+    }
+
+    if array_one.is_empty() || array_one.len() != array_two.len() {
+        Err(Box::new(std::io::Error::new(
+            std::io::ErrorKind::InvalidInput,
+            "Invalid input. Arrays must have a length > 0 and have an identical length",
+        )))
+    } else {
+        let distance = calculate_distance(&mut array_one[..], &mut array_two[..]);
+        let score = calculate_score(&mut array_one[..], &mut array_two[..]);
+        Ok((distance, score))
+    }
+}
+
+#[cfg(test)]
+mod test {
+    use super::*;
+
+    #[test]
+    fn test_day01() {
+        let mut array_one = [3, 4, 2, 1, 3, 3];
+        let mut array_two = [4, 3, 5, 3, 9, 3];
+
+        let want = 11;
+
+        assert_eq!(
+            calculate_distance(&mut array_one[..], &mut array_two[..]),
+            want
+        );
+
+        let want = 31;
+        assert_eq!(
+            calculate_score(&mut array_one[..], &mut array_two[..]),
+            want
+        );
+    }
+}

src/lib.rs

@@ -0,0 +1 @@
+pub mod day01;

src/main.rs

@@ -1,3 +1,22 @@
+use adventofcode_24::day01::solve_day01;
+use clap::{Arg, Command};
+
 fn main() {
-    println!("Hello, world!");
+    let matches = Command::new("aoc")
+        .version("1.0")
+        .author("itsscb <dev@itsscb.de>")
+        .about("Solves Advent of Code 2024 puzzles")
+        .arg(
+            Arg::new("day01")
+                .short('1')
+                .help("Path to Day 01 Input file"),
+        )
+        .get_matches();
+
+    if let Some(file) = matches.get_one::<String>("day01") {
+        match solve_day01(file) {
+            Ok((d, s)) => println!("Result of Day 01:\nDistance: {d}\nScore: {s}"),
+            Err(e) => eprintln!("{e}"),
+        }
+    }
 }