bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-25 21:00:31 +01:00
Code Issues Projects Releases Wiki Activity

Day 4: more efficiently ignore completed cards

Browse Source
This commit is contained in:
Bert Peters
2021-12-04 11:40:40 +01:00
parent fdef10a78e
commit e50b812aed
1 changed files with 13 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
2021/src/day04.rs
View File

@@ -58,7 +58,7 @@ fn read_input(input: &mut dyn Read) -> (Vec<u8>, Vec<BingoCard>) {
let mut bingo_cards = Vec::new(); let mut bingo_cards = Vec::new();
while reader.next().is_some() { while reader.next().is_some() {
let mut mapping = HashMap::new(); let mut mapping = HashMap::with_capacity(25);
for y in 0..5 { for y in 0..5 {
reader reader
@@ -99,16 +99,20 @@ pub fn part1(input: &mut dyn Read) -> String {
pub fn part2(input: &mut dyn Read) -> String { pub fn part2(input: &mut dyn Read) -> String {
let (numbers, mut bingo_cards) = read_input(input); let (numbers, mut bingo_cards) = read_input(input);
let mut bingo_won = vec![false; bingo_cards.len()];
let mut num_won = 0;
let to_win = bingo_cards.len();
for number in numbers { for num in numbers {
bingo_cards.iter_mut().for_each(|card| { for (won, card) in bingo_won.iter_mut().zip(bingo_cards.iter_mut()) {
card.cross(number); if !*won && card.cross(num) && card.has_won() {
}); *won = true;
num_won += 1;
if bingo_cards.len() == 1 && bingo_cards[0].cross(number) && bingo_cards[0].has_won() { if num_won == to_win {
return (number as u32 * bingo_cards[0].remaining()).to_string(); return (num as u32 * card.remaining()).to_string();
} else { }
bingo_cards.retain(|card| !card.has_won()); }
} }
} }