diff options
Diffstat (limited to 'day11/src/main.rs')
-rw-r--r-- | day11/src/main.rs | 94 |
1 files changed, 0 insertions, 94 deletions
diff --git a/day11/src/main.rs b/day11/src/main.rs deleted file mode 100644 index 960accf..0000000 --- a/day11/src/main.rs +++ /dev/null | |||
@@ -1,94 +0,0 @@ | |||
1 | use std::fs; | ||
2 | use std::path::Path; | ||
3 | use std::collections::VecDeque; | ||
4 | |||
5 | const WIDTH: usize = 10; | ||
6 | const HEIGHT: usize = 10; | ||
7 | |||
8 | /* AOC21 Day 11: https://adventofcode.com/2021/day/11 */ | ||
9 | fn main() { | ||
10 | let input = Path::new("resources").join("input.txt"); | ||
11 | let content = fs::read_to_string(input).expect("Unable to read input file"); | ||
12 | ex1(&content, 100); | ||
13 | ex2(&content); | ||
14 | } | ||
15 | |||
16 | fn ex1(content: &str, steps: u32) { | ||
17 | let mut energy: Vec<u8> = content.lines().flat_map(|l| l.bytes().map(|b| b-b'0')).collect(); | ||
18 | let mut queue: VecDeque<usize> = VecDeque::with_capacity(2*WIDTH*HEIGHT); | ||
19 | println!("Ex1: the result is {}", (0..steps).map(|_| step(&mut energy, &mut queue)).sum::<usize>()) | ||
20 | } | ||
21 | |||
22 | fn ex2(content: &str) { | ||
23 | let mut energy: Vec<u8> = content.lines().flat_map(|l| l.bytes().map(|b| b-b'0')).collect(); | ||
24 | let mut queue: VecDeque<usize> = VecDeque::with_capacity(2*WIDTH*HEIGHT); | ||
25 | println!("Ex2: the result is {}", (1..).find(|_| step(&mut energy, &mut queue) == WIDTH*HEIGHT).unwrap()); | ||
26 | } | ||
27 | |||
28 | fn step(energy: &mut [u8], queue: &mut VecDeque<usize>) -> usize { | ||
29 | queue.extend(0..energy.len()); | ||
30 | while let Some(i) = queue.pop_front() { | ||
31 | octopus(energy, queue, i); | ||
32 | } | ||
33 | energy.iter_mut().filter_map(|o| if *o > 9 { *o = 0; Some(o) } else { None }).count() | ||
34 | } | ||
35 | |||
36 | fn octopus(energy: &mut [u8], queue: &mut VecDeque<usize>, i: usize) { | ||
37 | let len = energy.len(); | ||
38 | energy[i] += 1; | ||
39 | if energy[i] == 10 { | ||
40 | if i%WIDTH > 0 { | ||
41 | queue.push_back(i-1); | ||
42 | if i >= WIDTH+1 { queue.push_back(i-WIDTH-1) } | ||
43 | if i+WIDTH-1 < len { queue.push_back(i+WIDTH-1) } | ||
44 | } | ||
45 | if (i+1)%WIDTH > 0 { | ||
46 | queue.push_back(i+1); | ||
47 | if i >= WIDTH-1 { queue.push_back(i+1-WIDTH) } | ||
48 | if i+WIDTH+1 < len { queue.push_back(i+1+WIDTH) } | ||
49 | } | ||
50 | if i >= WIDTH { queue.push_back(i-WIDTH) } | ||
51 | if i+WIDTH < len { queue.push_back(i+WIDTH) } | ||
52 | } | ||
53 | } | ||
54 | |||
55 | #[cfg(test)] | ||
56 | mod tests { | ||
57 | use super::*; | ||
58 | |||
59 | const INPUT: [u8;100] = [ | ||
60 | 5,4,8,3,1,4,3,2,2,3, | ||
61 | 2,7,4,5,8,5,4,7,1,1, | ||
62 | 5,2,6,4,5,5,6,1,7,3, | ||
63 | 6,1,4,1,3,3,6,1,4,6, | ||
64 | 6,3,5,7,3,8,5,4,7,8, | ||
65 | 4,1,6,7,5,2,4,6,4,5, | ||
66 | 2,1,7,6,8,4,1,7,2,1, | ||
67 | 6,8,8,2,8,8,1,1,3,4, | ||
68 | 4,8,4,6,8,4,8,5,5,4, | ||
69 | 5,2,8,3,7,5,1,5,2,6 | ||
70 | ]; | ||
71 | |||
72 | #[test] | ||
73 | fn step10() { | ||
74 | let mut input = INPUT.clone(); | ||
75 | let mut queue = VecDeque::with_capacity(200); | ||
76 | let flash = (0..10).map(|_| step(&mut input, &mut queue)).sum::<usize>(); | ||
77 | assert_eq!(204, flash); | ||
78 | } | ||
79 | |||
80 | #[test] | ||
81 | fn step100() { | ||
82 | let mut input = INPUT.clone(); | ||
83 | let mut queue = VecDeque::with_capacity(200); | ||
84 | let flash = (0..100).map(|_| step(&mut input, &mut queue)).sum::<usize>(); | ||
85 | assert_eq!(1656, flash); | ||
86 | } | ||
87 | |||
88 | #[test] | ||
89 | fn synchronised() { | ||
90 | let mut input = INPUT.clone(); | ||
91 | let mut queue: VecDeque<usize> = VecDeque::with_capacity(2*WIDTH*HEIGHT); | ||
92 | assert_eq!(195, (1..).find(|_| step(&mut input, &mut queue) == WIDTH*HEIGHT).unwrap()); | ||
93 | } | ||
94 | } | ||