kamov/advent-of-code
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

2022 rust day 11

Browse source
This commit is contained in:
Maciej Jur 2022-12-11 13:08:19 +01:00
parent 1442254825
commit 7bf8354933
1 changed files with 1 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
2022/rust/src/solutions/day11.rs
View file

@ -35,10 +35,6 @@ fn transfer_items(source: &mut VecDeque<i64>, destination: &mut VecDeque<i64>) {
} }
} }
fn simplify_factor(n: i64) -> i64 {
n
}
fn find_inspects(data: &Vec<Monkey>, rounds: i32) -> BinaryHeap<i64> { fn find_inspects(data: &Vec<Monkey>, rounds: i32) -> BinaryHeap<i64> {
let mut monkeys: Vec<VecDeque<i64>> = data.iter().map(|m| m.items.iter().copied().collect()).collect(); let mut monkeys: Vec<VecDeque<i64>> = data.iter().map(|m| m.items.iter().copied().collect()).collect();
let mut inspections: HashMap<usize, i64> = HashMap::new(); let mut inspections: HashMap<usize, i64> = HashMap::new();
@ -73,6 +69,7 @@ fn solve1(data: &Vec<Monkey>) -> i64 {
heap.pop().unwrap() * heap.pop().unwrap() heap.pop().unwrap() * heap.pop().unwrap()
} }
// brb, speedrunning modular arithmetic course to solve this puzzle
fn solve2(data: &Vec<Monkey>) -> i64 { fn solve2(data: &Vec<Monkey>) -> i64 {
let mut heap = find_inspects(&data, 10000); let mut heap = find_inspects(&data, 10000);
heap.pop().unwrap() * heap.pop().unwrap() heap.pop().unwrap() * heap.pop().unwrap()