-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday20.rs
285 lines (239 loc) · 7.51 KB
/
day20.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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
//! [Day 20: Pulse Propagation](https://adventofcode.com/2023/day/20)
use num::Integer;
use rustc_hash::FxHashMap;
use std::collections::VecDeque;
fn lcm(values: &[u64]) -> u64 {
let mut m = 1;
for x in values {
m = m.lcm(x);
}
m
}
#[derive(PartialEq, Clone)]
enum ModuleType {
Broadcaster,
Flipflop,
Conjunction,
}
#[derive(PartialEq, Clone, Copy)]
enum Pulse {
Low,
High,
}
#[derive(PartialEq, Clone, Copy)]
enum State {
Off,
On,
}
impl std::ops::Not for State {
type Output = Self;
fn not(self) -> Self {
match self {
Self::On => Self::Off,
Self::Off => Self::On,
}
}
}
#[derive(Clone)]
struct Module {
id: u32,
kind: ModuleType,
outputs: Vec<u32>,
state: State, // only for Flip-flop module
memory: FxHashMap<u32, Pulse>, // only for Conjunction module
}
fn get_id(name: &str) -> u32 {
if name == "broadcaster" {
return 0;
}
assert!(name.chars().all(|c| c.is_ascii_lowercase()));
name.chars().fold(0, |acc, c| acc * 26 + (c as u32) - 96)
}
struct Puzzle {
modules: FxHashMap<u32, Module>,
}
impl Puzzle {
fn new(data: &str) -> Self {
let mut modules = FxHashMap::default();
for line in data.lines() {
let (name, dests) = line.split_once(" -> ").unwrap();
let outputs: Vec<u32> = dests.split(", ").map(get_id).collect();
let (name, mtype) = match &name[0..1] {
"%" => (&name[1..], ModuleType::Flipflop),
"&" => (&name[1..], ModuleType::Conjunction),
_ => (name, ModuleType::Broadcaster),
};
let id = get_id(name);
modules.insert(
id,
Module {
id,
kind: mtype,
outputs,
state: State::Off,
memory: FxHashMap::default(),
},
);
}
let values = modules.clone();
// find modules that are connected to a Conjunction module:
// they feed pulses the module remembers to send its pulse
for module in modules.values_mut() {
if module.kind == ModuleType::Conjunction {
for m in values.values() {
// ^== borrowing problem here
if m.outputs.contains(&module.id) {
module.memory.insert(m.id, Pulse::Low);
}
}
}
}
Self { modules }
}
/// Reset the modules to their initial state.
fn reset(&mut self) {
for module in self.modules.values_mut() {
module.state = State::Off;
for level in module.memory.values_mut() {
*level = Pulse::Low;
}
}
}
/// Propagate a pulse.
fn propagate(
&mut self,
source: u32,
target: u32,
pulse: Pulse,
q: &mut VecDeque<(u32, u32, Pulse)>,
) {
if let Some(module) = self.modules.get_mut(&target) {
if module.kind == ModuleType::Broadcaster {
for &output in &module.outputs {
q.push_back((target, output, pulse));
}
} else if module.kind == ModuleType::Flipflop {
if pulse == Pulse::Low {
module.state = !module.state;
let outgoing = match module.state {
State::Off => Pulse::Low,
State::On => Pulse::High,
};
for e in &module.outputs {
q.push_back((module.id, *e, outgoing));
}
}
} else if module.kind == ModuleType::Conjunction {
module.memory.insert(source, pulse);
let outgoing = if module.memory.values().all(|&level| level == Pulse::High) {
Pulse::Low
} else {
Pulse::High
};
for e in &module.outputs {
q.push_back((module.id, *e, outgoing));
}
}
}
}
fn press(&mut self, f: &mut dyn core::ops::FnMut(u32, u32, Pulse) -> bool) -> bool {
let mut q: VecDeque<(u32, u32, Pulse)> = VecDeque::new();
q.push_back((0, get_id("broadcaster"), Pulse::Low));
while let Some((source, target, pulse)) = q.pop_front() {
if !f(source, target, pulse) {
return false;
}
self.propagate(source, target, pulse, &mut q);
}
true
}
/// Solve part one.
fn part1(&mut self) -> u32 {
self.reset();
let mut lo = 0;
let mut hi = 0;
for _ in 0..1000 {
self.press(&mut |_, _, pulse| {
match pulse {
Pulse::Low => lo += 1,
Pulse::High => hi += 1,
}
true // continue to propagate the pulses
});
}
lo * hi
}
/// Solve part two.
fn part2(&mut self) -> u64 {
self.reset();
let rx = get_id("rx");
// find the module that feeds rx module
// &module -> rx
let rx_feed = self
.modules
.values()
.filter(|&module| module.outputs.contains(&rx))
.nth(0);
// it must be a Conjunction module (otherwise the problem is worthless)
if rx_feed.is_none() || rx_feed.unwrap().kind != ModuleType::Conjunction {
return 0;
}
// get its name
let rx_feed = rx_feed.unwrap().id;
// all modules that send to the rx_feed module
let rx_feed_inputs = self
.modules
.values()
.filter(|module| module.outputs.contains(&rx_feed))
.count();
// the count of presses to have a High pulse on each inputs of the rx_feed module
let mut rx_feed_input_presses = FxHashMap::default();
for presses in 1.. {
let stopped = !self.press(&mut |source, target, pulse| {
if target == rx_feed && pulse == Pulse::High {
// update the presses for the current input of the rx_feed module
rx_feed_input_presses
.entry(source.to_string())
.or_insert(presses);
// we have enough values
if rx_feed_input_presses.len() == rx_feed_inputs {
return false; // stop the circuit
}
}
true
});
if stopped {
// the circuit is stopped: we have found the solution
let v: Vec<u64> = rx_feed_input_presses.values().copied().collect();
return lcm(&v);
}
}
0
}
}
/// # Panics
#[must_use]
pub fn solve(data: &str) -> (u32, u64) {
let mut puzzle = Puzzle::new(data);
(puzzle.part1(), puzzle.part2())
}
pub fn main() {
let args = aoc::parse_args();
args.run(solve);
}
#[cfg(test)]
mod test {
use super::*;
const TEST_INPUT: &str = include_str!("test.txt");
const TEST_INPUT_2: &str = include_str!("test2.txt");
#[test]
fn test01() {
let mut puzzle = Puzzle::new(TEST_INPUT);
assert_eq!(puzzle.part1(), 32_000_000);
}
#[test]
fn test02() {
let mut puzzle = Puzzle::new(TEST_INPUT_2);
assert_eq!(puzzle.part1(), 11_687_500);
}
}