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
|
use crate::util::grid::*;
pub fn part1() -> anyhow::Result<i64> {
let map = data_digit_grid!();
let mut risk = 0;
for ((row, col), pos) in map.indexed_cells() {
if map
.adjacent(row, col, false)
.map(|(row, col)| map[row][col])
.all(|n| *pos < n)
{
risk += 1 + *pos as i64;
}
}
Ok(risk)
}
pub fn part2() -> anyhow::Result<i64> {
let map = data_digit_grid!();
let mut low = vec![];
for ((row, col), pos) in map.indexed_cells() {
if map
.adjacent(row, col, false)
.map(|(row, col)| map[row][col])
.all(|n| *pos < n)
{
low.push((row, col));
}
}
let mut sizes = vec![];
for (row, col) in low {
let mut basin: Grid<bool> = Grid::default();
basin.grow(map.rows(), map.cols());
let mut check = vec![(row, col)];
let mut count = 0;
while let Some((row, col)) = check.pop() {
if basin[row][col] || map[row][col] == 9 {
continue;
}
basin[row][col] = true;
count += 1;
for (row, col) in basin.adjacent(row, col, false) {
if !basin[row][col] {
check.push((row, col));
}
}
}
sizes.push(count);
}
sizes.sort_unstable();
Ok(sizes[sizes.len() - 1]
* sizes[sizes.len() - 2]
* sizes[sizes.len() - 3])
}
#[test]
fn test() {
assert_eq!(part1().unwrap(), 570);
assert_eq!(part2().unwrap(), 899392);
}
|