2022 day 23 rust
This commit is contained in:
parent
2f381d6158
commit
912a1c569c
|
@ -1,3 +1,4 @@
|
||||||
|
#![allow(dead_code)]
|
||||||
use std::collections::{HashMap, HashSet, VecDeque};
|
use std::collections::{HashMap, HashSet, VecDeque};
|
||||||
use crate::utils;
|
use crate::utils;
|
||||||
|
|
||||||
|
@ -96,13 +97,15 @@ fn count_empty(elves: &Vec<Loc>) -> i32 {
|
||||||
sum
|
sum
|
||||||
}
|
}
|
||||||
|
|
||||||
fn solve1(data: &HashSet<Loc>) -> i32 {
|
fn round_iter(data: &HashSet<Loc>) -> Box<dyn Iterator<Item=(bool, Vec<Loc>)>> {
|
||||||
let mut elves = Vec::from_iter(data.iter().copied());
|
let mut elves = Vec::from_iter(data.iter().copied());
|
||||||
let mut moves = VecDeque::from([move_n, move_s, move_w, move_e]);
|
let mut moves = VecDeque::from([move_n, move_s, move_w, move_e]);
|
||||||
|
|
||||||
for _ in 0..10 {
|
Box::new(std::iter::repeat(())
|
||||||
let occupied = HashSet::<Loc>::from_iter(elves.iter().copied());
|
.map(move |_| {
|
||||||
|
let occupied = HashSet::from_iter(elves.iter().copied());
|
||||||
let mut planned = HashMap::<Loc, Vec<usize>>::new();
|
let mut planned = HashMap::<Loc, Vec<usize>>::new();
|
||||||
|
|
||||||
for (index, &loc) in elves.iter().enumerate().filter(|&(_, loc)| has_neighbors(&occupied, *loc)) {
|
for (index, &loc) in elves.iter().enumerate().filter(|&(_, loc)| has_neighbors(&occupied, *loc)) {
|
||||||
if let Some(loc) = moves.iter().filter_map(|f| f(&occupied, loc)).next() {
|
if let Some(loc) = moves.iter().filter_map(|f| f(&occupied, loc)).next() {
|
||||||
planned.entry(loc)
|
planned.entry(loc)
|
||||||
|
@ -111,41 +114,23 @@ fn solve1(data: &HashSet<Loc>) -> i32 {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
let mut changed = false;
|
||||||
for (loc, planned) in planned.into_iter().filter(|(_, vec)| vec.len() == 1) {
|
for (loc, planned) in planned.into_iter().filter(|(_, vec)| vec.len() == 1) {
|
||||||
elves[planned[0]] = loc;
|
elves[planned[0]] = loc;
|
||||||
|
changed = true;
|
||||||
}
|
}
|
||||||
|
|
||||||
moves.rotate_left(1);
|
moves.rotate_left(1);
|
||||||
|
(changed, elves.clone())
|
||||||
|
}))
|
||||||
}
|
}
|
||||||
|
|
||||||
count_empty(&elves)
|
fn solve1(data: &HashSet<Loc>) -> i32 {
|
||||||
|
count_empty(&round_iter(data).skip(9).next().unwrap().1)
|
||||||
}
|
}
|
||||||
|
|
||||||
fn solve2(data: &HashSet<Loc>) -> i32 {
|
fn solve2(data: &HashSet<Loc>) -> usize {
|
||||||
let mut elves = Vec::from_iter(data.iter().copied());
|
1 + round_iter(data).enumerate().skip_while(|(_, (changed, _))| *changed).next().unwrap().0
|
||||||
let mut moves = VecDeque::from([move_n, move_s, move_w, move_e]);
|
|
||||||
|
|
||||||
for round in 1..i32::MAX {
|
|
||||||
let occupied = HashSet::<Loc>::from_iter(elves.iter().copied());
|
|
||||||
let mut planned = HashMap::<Loc, Vec<usize>>::new();
|
|
||||||
for (index, &loc) in elves.iter().enumerate().filter(|&(_, loc)| has_neighbors(&occupied, *loc)) {
|
|
||||||
if let Some(loc) = moves.iter().filter_map(|f| f(&occupied, loc)).next() {
|
|
||||||
planned.entry(loc)
|
|
||||||
.and_modify(|v| v.push(index))
|
|
||||||
.or_insert(vec![index]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
let changes = planned.into_iter().filter(|(_, vec)| vec.len() == 1).collect::<Vec<_>>();
|
|
||||||
if changes.len() == 0 { return round }
|
|
||||||
|
|
||||||
for (loc, planned) in changes {
|
|
||||||
elves[planned[0]] = loc;
|
|
||||||
}
|
|
||||||
|
|
||||||
moves.rotate_left(1);
|
|
||||||
};
|
|
||||||
panic!()
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue