wathiede/aoc
1
0
Fork 0
forked from ggriffiniii/aoc
Code Issues Pull Requests Releases Wiki Activity

cargo fmt

Browse Source
This commit is contained in:
Glenn Griffin 2020-12-18 16:08:29 -08:00
parent 9e2e317f8d
commit 40b618593f
1 changed files with 43 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

73
src/day17.rs
View File

@ -5,24 +5,31 @@ use std::collections::HashSet;
fn solve_d17_p1(input: &str) -> usize {
let mut world = HashSet::new();
for (y, line) in input.split('\n').enumerate() {
for (x, _) in line.as_bytes().iter().copied().enumerate().filter(|&(_, byte)| {
byte == b'#'
}) {
for (x, _) in line
.as_bytes()
.iter()
.copied()
.enumerate()
.filter(|&(_, byte)| byte == b'#')
{
world.insert((x as isize, y as isize, 0isize, 0isize));
}
}
for _ in 0 .. 6 {
for _ in 0..6 {
world = step(world);
}
world.len()
}
fn neighbors(world: &HashSet<(isize, isize, isize, isize)>, (x, y, z, w): (isize, isize, isize, isize)) -> usize {
fn neighbors(
world: &HashSet<(isize, isize, isize, isize)>,
(x, y, z, w): (isize, isize, isize, isize),
) -> usize {
let mut count = 0;
for xa in x-1..=x+1 {
for ya in y-1..=y+1 {
for za in z-1..=z+1 {
for wa in w-1..=w+1 {
for xa in x - 1..=x + 1 {
for ya in y - 1..=y + 1 {
for za in z - 1..=z + 1 {
for wa in w - 1..=w + 1 {
count += world.contains(&(xa, ya, za, wa)) as usize;
}
}
@ -42,19 +49,27 @@ fn step(world: HashSet<(isize, isize, isize, isize)>) -> HashSet<(isize, isize,
w_min: isize,
w_max: isize,
}
let MinMax{
x_min, x_max, y_min, y_max, z_min, z_max, w_min, w_max,
} = world.iter().fold(MinMax{
x_min: isize::MAX,
x_max: isize::MIN,
y_min: isize::MAX,
y_max: isize::MIN,
z_min: isize::MAX,
z_max: isize::MIN,
w_min: isize::MAX,
w_max: isize::MIN,
}, |minmax, &(x, y, z, w)| {
MinMax{
let MinMax {
x_min,
x_max,
y_min,
y_max,
z_min,
z_max,
w_min,
w_max,
} = world.iter().fold(
MinMax {
x_min: isize::MAX,
x_max: isize::MIN,
y_min: isize::MAX,
y_max: isize::MIN,
z_min: isize::MAX,
z_max: isize::MIN,
w_min: isize::MAX,
w_max: isize::MIN,
},
|minmax, &(x, y, z, w)| MinMax {
x_min: std::cmp::min(minmax.x_min, x),
x_max: std::cmp::max(minmax.x_max, x),
y_min: std::cmp::min(minmax.y_min, y),
@ -63,13 +78,13 @@ fn step(world: HashSet<(isize, isize, isize, isize)>) -> HashSet<(isize, isize,
z_max: std::cmp::max(minmax.z_max, z),
w_min: std::cmp::min(minmax.w_min, w),
w_max: std::cmp::max(minmax.w_max, w),
}
});
},
);
let mut new_world = HashSet::new();
for x in x_min -1 ..= x_max + 1 {
for y in y_min -1 ..= y_max + 1 {
for z in z_min -1 ..= z_max + 1 {
for w in w_min -1 ..= w_max + 1 {
for x in x_min - 1..=x_max + 1 {
for y in y_min - 1..=y_max + 1 {
for z in z_min - 1..=z_max + 1 {
for w in w_min - 1..=w_max + 1 {
let active = world.contains(&(x, y, z, w));
let n = neighbors(&world, (x, y, z, w));
if active && (n == 2 || n == 3) {
@ -84,5 +99,3 @@ fn step(world: HashSet<(isize, isize, isize, isize)>) -> HashSet<(isize, isize,
}
new_world
}