generated from fspoettel/advent-of-code-rust
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path20.rs
396 lines (341 loc) · 10.9 KB
/
20.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
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
use enum_dispatch::enum_dispatch;
use std::collections::{HashMap, HashSet, VecDeque};
use std::fmt::Display;
use itertools::Itertools;
use nom::branch::alt;
use nom::bytes::complete::tag;
use nom::character::complete::{alpha1, line_ending};
use nom::combinator::map;
use nom::multi::separated_list1;
use nom::sequence::{preceded, separated_pair};
use nom::IResult;
use num::integer::lcm;
advent_of_code::solution!(20);
#[derive(Copy, Clone, Debug, Eq, PartialEq)]
enum ModuleType {
Broadcast,
FlipFlop,
Conjunction,
}
#[derive(Debug, Clone)]
struct ModuleSpec<T> {
label: T,
module_type: ModuleType,
destinations: Vec<T>,
}
fn parse_input(input: &str) -> IResult<&str, Vec<ModuleSpec<String>>> {
separated_list1(
line_ending,
map(
separated_pair(
alt((
map(tag("broadcaster"), |label| (label, ModuleType::Broadcast)),
map(preceded(tag("%"), alpha1), |label| {
(label, ModuleType::FlipFlop)
}),
map(preceded(tag("&"), alpha1), |label| {
(label, ModuleType::Conjunction)
}),
)),
tag(" -> "),
separated_list1(tag(", "), map(alpha1, str::to_string)),
),
|((label, module_type), destinations)| ModuleSpec {
label: label.to_string(),
module_type,
destinations,
},
),
)(input)
}
#[derive(Clone)]
struct Pulse {
source: usize,
destination: usize,
is_high: bool,
}
impl Display for Pulse {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
write!(
f,
"{} -{}> {}",
self.source,
if self.is_high { "high" } else { "low" },
self.destination,
)
}
}
#[enum_dispatch(PulseReceiver)]
enum Module {
Broadcast(BroadcastModule),
FlipFlop(FlipFlopModule),
Conjunction(ConjunctionModule),
}
#[enum_dispatch]
trait PulseReceiver {
fn receive_pulse(&mut self, pulse: Pulse, queue: &mut VecDeque<Pulse>);
}
struct BroadcastModule {
label: usize,
destinations: Vec<usize>,
}
impl BroadcastModule {
fn new(label: usize, destinations: Vec<usize>) -> Self {
Self {
label,
destinations,
}
}
}
impl PulseReceiver for BroadcastModule {
fn receive_pulse(&mut self, pulse: Pulse, queue: &mut VecDeque<Pulse>) {
queue.extend(self.destinations.iter().map(|destination| Pulse {
source: self.label,
destination: *destination,
is_high: pulse.is_high,
}));
}
}
struct FlipFlopModule {
label: usize,
destinations: Vec<usize>,
is_high: bool,
}
impl FlipFlopModule {
fn new(label: usize, destinations: Vec<usize>) -> Self {
Self {
label,
destinations,
is_high: false,
}
}
}
impl PulseReceiver for FlipFlopModule {
fn receive_pulse(&mut self, pulse: Pulse, queue: &mut VecDeque<Pulse>) {
if pulse.is_high {
return;
}
self.is_high = !self.is_high;
queue.extend(self.destinations.iter().map(|destination| Pulse {
source: self.label,
destination: *destination,
is_high: self.is_high,
}));
}
}
struct ConjunctionModule {
label: usize,
destinations: Vec<usize>,
/// A bit vector where each bit represents whether the last pulse from that module was high or low. This assumes
/// that the total number of modules is less than the number of bits in usize.
inputs: usize,
}
impl ConjunctionModule {
fn new(label: usize, destinations: Vec<usize>, inputs: Vec<usize>) -> Self {
Self {
label,
destinations,
inputs: {
let mut values = usize::MAX;
for idx in inputs {
// Unset the bit at idx
values &= !(1 << idx);
}
values
},
}
}
}
impl PulseReceiver for ConjunctionModule {
fn receive_pulse(&mut self, pulse: Pulse, queue: &mut VecDeque<Pulse>) {
if pulse.is_high {
self.inputs |= 1 << pulse.source;
} else {
self.inputs &= !(1 << pulse.source);
}
let is_high = self.inputs == usize::MAX;
queue.extend(self.destinations.iter().map(|destination| Pulse {
source: self.label,
destination: *destination,
is_high: !is_high,
}))
}
}
fn initialize_modules(
module_specs: Vec<ModuleSpec<String>>,
) -> (HashMap<String, usize>, Vec<Module>) {
let source_labels = module_specs
.iter()
.map(|spec| spec.label.clone())
.collect::<HashSet<_>>();
let destination_labels = module_specs
.iter()
.flat_map(|spec| spec.destinations.clone())
.collect::<HashSet<_>>();
let destination_labels = destination_labels
.difference(&source_labels)
.cloned()
.collect_vec();
let source_labels = source_labels.iter().cloned().collect_vec();
let label_to_id = HashMap::<String, usize>::from_iter(
source_labels
.iter()
.chain(destination_labels.iter())
.enumerate()
.map(|(id, label)| (label.clone(), id)),
);
let mut module_specs = module_specs
.into_iter()
.map(|spec| {
let id = label_to_id[&spec.label];
let destinations = spec
.destinations
.into_iter()
.map(|destination| label_to_id[&destination])
.collect();
ModuleSpec {
label: id,
module_type: spec.module_type,
destinations,
}
})
.collect_vec();
let reverse_adjacency_list: Vec<Vec<usize>> = module_specs
.iter()
.flat_map(|module_spec| {
module_spec
.destinations
.iter()
.map(move |destination| (*destination, module_spec.label))
})
.fold(
vec![vec![]; label_to_id.len()],
|mut map, (destination, source)| {
map[destination].push(source);
map
},
);
module_specs.sort_by_key(|spec| spec.label);
let modules = module_specs
.into_iter()
.map(|module_spec| -> Module {
match module_spec.module_type {
ModuleType::Broadcast => {
BroadcastModule::new(module_spec.label, module_spec.destinations.to_vec())
.into()
}
ModuleType::FlipFlop => {
FlipFlopModule::new(module_spec.label, module_spec.destinations.to_vec()).into()
}
ModuleType::Conjunction => ConjunctionModule::new(
module_spec.label,
module_spec.destinations.to_vec(),
reverse_adjacency_list[module_spec.label].clone(),
)
.into(),
}
})
.collect_vec();
(label_to_id, modules)
}
pub fn part_one(input: &str) -> Option<u32> {
let (_, module_specs) = parse_input(input).unwrap();
let (label_to_id, mut modules) = initialize_modules(module_specs);
let mut queue = VecDeque::new();
let mut low_pulses_sent = 0;
let mut high_pulses_sent = 0;
let broadcaster_id = label_to_id["broadcaster"];
for _ in 0..1000 {
queue.push_back(Pulse {
source: usize::MAX,
destination: broadcaster_id,
is_high: false,
});
while let Some(pulse) = queue.pop_front() {
match pulse.is_high {
true => high_pulses_sent += 1,
false => low_pulses_sent += 1,
};
if let Some(module) = modules.get_mut(pulse.destination) {
module.receive_pulse(pulse, &mut queue);
}
}
}
Some(low_pulses_sent * high_pulses_sent)
}
pub fn part_two(input: &str) -> Option<usize> {
let (_, module_specs) = parse_input(input).unwrap();
let module_specs_map = module_specs
.into_iter()
.map(|spec| (spec.label.clone(), spec))
.collect::<HashMap<_, _>>();
let broadcaster = module_specs_map["broadcaster"].clone();
let subgraph_output_label = "rm".to_string();
let mut result = 1;
for subgraph_input_label in broadcaster.destinations {
// Collect subgraph rooted at node with label `subgraph_input_label`
let mut subgraph = HashSet::<String>::new();
let mut queue = VecDeque::new();
queue.push_back(subgraph_input_label.clone());
while let Some(label) = queue.pop_front() {
if subgraph.contains(&label) {
continue;
}
subgraph.insert(label.clone());
queue.extend(
module_specs_map[&label]
.destinations
.iter()
.filter(|label| **label != subgraph_output_label)
.cloned(),
);
}
// Add broadcaster module to subgraph, so that we can execute the subgraph as if it were part of the full graph
subgraph.insert("broadcaster".to_string());
let subgraph_module_specs = subgraph
.iter()
.map(|label| module_specs_map[label].clone())
.collect_vec();
let (label_to_id, mut modules) = initialize_modules(subgraph_module_specs);
let broadcaster_id = label_to_id["broadcaster"];
let subgraph_output_id = label_to_id[&subgraph_output_label];
// Count number of button presses until the subgraph output module ("rm") receives a high pulse
let mut button_presses = 0;
let mut queue = VecDeque::new();
'foo: loop {
queue.push_back(Pulse {
source: usize::MAX,
destination: broadcaster_id,
is_high: false,
});
button_presses += 1;
while let Some(pulse) = queue.pop_front() {
if pulse.destination == subgraph_output_id && pulse.is_high {
break 'foo;
}
if let Some(module) = modules.get_mut(pulse.destination) {
module.receive_pulse(pulse, &mut queue);
}
}
}
result = lcm(result, button_presses);
}
Some(result)
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_part_one() {
let result = part_one(&advent_of_code::template::read_file_part(
"examples", DAY, 1,
));
assert_eq!(result, Some(32000000));
let result = part_one(&advent_of_code::template::read_file_part(
"examples", DAY, 2,
));
assert_eq!(result, Some(11687500));
}
#[test]
fn test_part_two() {}
}