-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday13.rs
89 lines (80 loc) · 2.18 KB
/
day13.rs
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
fn find_reflection<T: Eq, F: Fn(&[T], &[T]) -> bool>(data: &[T], eq: F) -> usize {
(1..data.len())
.find(|&i| eq(&data[..i], &data[i..]))
.unwrap_or_default()
}
fn solve<F: Fn(&[&[u8]], &[&[u8]]) -> bool>(lines: &[&[u8]], eq: F) -> usize {
let width = lines
.iter()
.map(|line| line.len())
.max()
.unwrap_or_default();
let transpose = (0..width)
.map(|i| lines.iter().map(|line| line[i]).collect::<Vec<_>>())
.collect::<Vec<_>>();
let transpose = transpose.iter().map(|line| &line[..]).collect::<Vec<_>>();
100 * find_reflection(lines, &eq) + find_reflection(&transpose, &eq)
}
pub fn part1(data: &str) -> usize {
data.split("\n\n")
.map(|group| {
solve(
&group
.lines()
.map(|line| line.as_bytes())
.collect::<Vec<_>>(),
|x, y| x.iter().rev().zip(y.iter()).all(|(a, b)| a == b),
)
})
.sum()
}
pub fn part2(data: &str) -> usize {
data.split("\n\n")
.map(|group| {
solve(
&group
.lines()
.map(|line| line.as_bytes())
.collect::<Vec<_>>(),
|x, y| {
let mut iter = x
.iter()
.rev()
.zip(y.iter())
.flat_map(|(a, b)| a.iter().zip(b.iter()).filter(|(c, d)| c != d));
iter.next().is_some() && iter.next().is_none()
},
)
})
.sum()
}
#[cfg(test)]
mod tests {
use super::*;
use indoc::indoc;
use pretty_assertions::assert_eq;
static EXAMPLE: &str = indoc! {"
#.##..##.
..#.##.#.
##......#
##......#
..#.##.#.
..##..##.
#.#.##.#.
#...##..#
#....#..#
..##..###
#####.##.
#####.##.
..##..###
#....#..#
"};
#[test]
fn part1_examples() {
assert_eq!(405, part1(EXAMPLE));
}
#[test]
fn part2_examples() {
assert_eq!(400, part2(EXAMPLE));
}
}