-
Notifications
You must be signed in to change notification settings - Fork 0
/
day-4.rs
55 lines (48 loc) · 1.64 KB
/
day-4.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
use aoc_2023::str_block;
use std::collections::HashSet;
const INPUT: &str = include_str!("day-4.txt");
#[allow(dead_code)]
const INPUT_EX: &str = str_block! {"
Card 1: 41 48 83 86 17 | 83 86 6 31 17 9 48 53
Card 2: 13 32 20 16 61 | 61 30 68 82 17 32 24 19
Card 3: 1 21 53 59 44 | 69 82 63 72 16 21 14 1
Card 4: 41 92 73 84 69 | 59 84 76 51 58 5 54 83
Card 5: 87 83 26 28 32 | 88 30 70 12 93 22 82 36
Card 6: 31 18 13 56 72 | 74 77 10 23 35 67 36 11
"};
aoc_2023::aoc! {
struct Day4 {
points: usize,
cards: usize,
}
self(input = INPUT) {
let mut points = 0;
let mut cards = Vec::new();
for (i, card) in input.lines().enumerate() {
let (_, card) = card.split_once(": ").ok_or("malformed line")?;
let (win, have) = card.split_once(" | ").ok_or("missing `|`")?;
let win = win.split_ascii_whitespace().map(|x| x.parse()).collect::<Result<HashSet<usize>, _>>()?;
let matches = have.split_ascii_whitespace().filter_map(
|x| win.contains(&x.parse().ok()?).then_some(())
).count();
if matches > 0 {
points += 1 << (matches - 1);
}
if cards.len() < i + matches + 1 {
cards.resize(i + matches + 1, 1);
}
for j in 0..matches {
cards[i + j + 1] += cards[i];
}
}
Ok(Self { points, cards: cards.into_iter().sum() })
}
1 part1 usize {
Ok(self.points)
}
2 part2 usize {
Ok(self.cards)
}
INPUT_EX { 1 part1 = 13, 2 part2 = 30 }
INPUT { 1 part1 = 26346, 2 part2 = 8467762 }
}