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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107

//! # Gear Ratios
use crate::util::grid::*;
use crate::util::parse::*;
use crate::util::point::*;

pub struct Input {
    grid: Grid<u8>,
    seen: Grid<usize>,
    parts: Vec<u32>,
}

pub fn parse(input: &str) -> Input {
    let grid = Grid::parse(input);
    // In order to tell if we've already seen a number before, store its index at the location
    // of every digit, using zero to indicate no value. For example:
    // `467..114..` => `1110022200`
    let mut seen: Grid<usize> = grid.default_copy();
    // Stores each unique part number. The first value is a dummy placeholder.
    let mut parts = vec![0];
    let mut number = 0;

    for y in 0..grid.height {
        for x in 0..grid.width {
            let p = Point::new(x, y);
            let b = grid[p];

            if b.is_ascii_digit() {
                // Parse contiguous groups of digits.
                seen[p] = parts.len();
                number = 10 * number + (b.to_decimal() as u32);
            } else if number > 0 {
                // If not a digit then finish the current number.
                parts.push(number);
                number = 0;
            }
        }
        // Actual corner case if the last number is in the bottom-right corner.
        if number > 0 {
            parts.push(number);
            number = 0;
        }
    }

    Input { grid, seen, parts }
}

/// Sum all part numbers adjacent to a least one symbol.
pub fn part1(input: &Input) -> u32 {
    let Input { grid, seen, parts } = input;
    let mut parts = parts.clone();
    let mut result = 0;

    for y in 0..grid.height {
        for x in 0..grid.width {
            let p = Point::new(x, y);
            let b = grid[p];

            if !b.is_ascii_digit() && b != b'.' {
                for next in DIAGONAL.iter().copied().map(|d| p + d) {
                    let index = seen[next];
                    if index != 0 {
                        result += parts[index];
                        // Only count each number once when its adjacent to multiple symbols.
                        parts[index] = 0;
                    }
                }
            }
        }
    }

    result
}

/// Sum all gears adjacent to exactly two part numbers.
pub fn part2(input: &Input) -> u32 {
    let Input { grid, seen, parts } = input;
    let mut result = 0;

    for y in 0..grid.height {
        for x in 0..grid.width {
            let p = Point::new(x, y);

            if grid[p] == b'*' {
                let mut previous = 0;
                let mut distinct = 0;
                let mut subtotal = 1;

                // Rely on the left to right and top to bottom order of DIAGONAL
                // to detect distinct numbers.
                for next in DIAGONAL.iter().copied().map(|d| p + d) {
                    let index = seen[next];
                    if index != 0 && index != previous {
                        previous = index;
                        distinct += 1;
                        subtotal *= parts[index];
                    }
                }

                if distinct == 2 {
                    result += subtotal;
                }
            }
        }
    }

    result
}