advent-of-code 2025.5.0

Solutions to Advent of Code
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54

use crate::input::Input;
use std::collections::HashSet;

pub fn solve(input: &Input) -> Result<u32, String> {
    const fn turn(direction: (i32, i32), right: bool) -> (i32, i32) {
        if right {
            (-direction.1, direction.0)
        } else {
            (direction.1, -direction.0)
        }
    }

    let mut visited_locations = HashSet::new();
    let mut position = (0, 0);
    let mut direction = (0, -1);

    'outer: for part in input.text.split(", ") {
        let on_error = || "Invalid input".to_string();
        if part.len() < 2 {
            return Err(on_error());
        }

        let (turn_str, number_str) = part.split_at(1);
        let number = number_str.parse::<i32>().map_err(|_| on_error())?;
        match turn_str {
            "L" => {
                direction = turn(direction, false);
            }
            "R" => {
                direction = turn(direction, true);
            }
            _ => {
                return Err(on_error());
            }
        }

        for _ in 0..number {
            if input.is_part_two() && !visited_locations.insert(position) {
                break 'outer;
            }

            position = (position.0 + direction.0, position.1 + direction.1);
        }
    }

    Ok((position.0.abs() + position.1.abs()) as u32)
}

#[test]
pub fn tests() {
    let real_input = include_str!("day01_input.txt");
    test_part_one!(real_input => 239);
    test_part_two!(real_input => 141);
}