-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday20.rs
273 lines (247 loc) · 8.5 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
use bitvec::prelude::*;
use num::Integer;
use std::{collections::VecDeque, ops::Range};
framework::day!(20, parse => pt1, pt2);
#[derive(Debug, Clone)]
struct ParseModule<'a> {
ty: ParseModuleType,
name: &'a [u8],
outputs: ArrayVec<&'a [u8], 8>,
}
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
enum ParseModuleType {
None,
FlipFlop,
Conjunction,
}
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
struct Ident(u8);
#[derive(Debug, Clone)]
struct Module {
ty: ModuleType,
inputs: ArrayVec<Ident, 16>,
outputs: ArrayVec<Ident, 8>,
}
#[derive(Debug, Clone)]
enum ModuleType {
None,
FlipFlop(u8),
Conjunction(Range<u8>),
}
struct Processed {
modules: Vec<Module>,
states: BitVec<u64, LocalBits>,
broadcaster: Ident,
rx: Option<Ident>,
}
fn preprocess(modules: &[ParseModule]) -> Result<Processed> {
let mut name_map = HashMap::new();
for name in (modules.iter().map(|m| m.name))
.chain(modules.iter().flat_map(|m| m.outputs.iter().cloned()))
{
let next_idx = name_map.len();
assert!(next_idx < 256);
_ = name_map.try_insert(name, Ident(next_idx as u8));
}
let modules_len = name_map.len();
let mut processed = (0..modules_len)
.map(|_| Module {
ty: ModuleType::None,
inputs: ArrayVec::new(),
outputs: ArrayVec::new(),
})
.collect_vec();
let resolve = |name: &[u8]| {
(name_map.get(name).cloned()).ok_or(Error::InvalidInput("module name does not exist"))
};
for (idx, module) in modules.iter().enumerate() {
for &target in &module.outputs {
let target = resolve(target)?;
processed[idx].outputs.push(target);
processed[target.0 as usize].inputs.push(Ident(idx as u8));
}
}
let mut states = BitVec::new();
for (idx, module) in modules.iter().enumerate() {
match module.ty {
ParseModuleType::None => (),
ParseModuleType::FlipFlop => {
processed[idx].ty = ModuleType::FlipFlop(states.len() as u8);
states.push(false);
}
ParseModuleType::Conjunction => {
let processed = &mut processed[idx];
let start = states.len();
let end = start + processed.inputs.len();
assert!(end < 256);
let range = start as u8..end as u8;
states.extend(range.clone().map(|_| false));
processed.ty = ModuleType::Conjunction(range);
}
}
}
let broadcaster = resolve(b"broadcaster")?;
let rx = name_map.get(b"rx".as_slice()).cloned();
Ok(Processed {
modules: processed,
states,
broadcaster,
rx,
})
}
type Pulse = (bool, Ident, Ident);
type PulseQueue = VecDeque<Pulse>;
#[derive(Debug, Clone, Default)]
struct Pulses {
queue: PulseQueue,
lo_count: u64,
hi_count: u64,
}
impl Pulses {
fn send(&mut self, hi: bool, source: Ident, target: Ident) {
if hi {
self.hi_count += 1;
} else {
self.lo_count += 1;
}
self.queue.push_back((hi, source, target));
}
fn send_many(&mut self, hi: bool, source: Ident, targets: &[Ident]) {
for &target in targets {
self.send(hi, source, target);
}
}
fn recv(&mut self) -> Option<(bool, Ident, Ident)> {
self.queue.pop_front()
}
}
fn pt1(modules: &[ParseModule]) -> Result<MulOutput<[u64; 2]>> {
let Processed {
modules,
mut states,
broadcaster,
..
} = preprocess(modules)?;
let mut pulses = Pulses::default();
for _ in 0..1000 {
pulses.send(false, broadcaster, broadcaster);
while let Some((hi, source, target)) = pulses.recv() {
let module = &modules[target.0 as usize];
let output = match &module.ty {
ModuleType::None => hi,
&ModuleType::FlipFlop(state) if !hi => {
let last_state = states.get_mut(state as usize).unwrap();
let new_state = !*last_state;
last_state.commit(new_state);
new_state
}
ModuleType::Conjunction(state_range) => {
let input_idx = module.inputs.iter().position(|&m| m == source).unwrap();
let states = &mut states[state_range.start as usize..state_range.end as usize];
states.set(input_idx, hi);
!states.all()
}
_ => continue,
};
pulses.send_many(output, target, &module.outputs);
}
}
Ok(MulOutput([pulses.lo_count, pulses.hi_count]))
}
fn pt2(modules: &[ParseModule]) -> Result<u64> {
let Processed {
modules,
mut states,
broadcaster,
rx,
} = preprocess(modules)?;
let rx = rx.ok_or(Error::InvalidInput("missing rx"))?;
let mut pulses = PulseQueue::new();
let conjunction_idx = (modules.iter())
.positions(|m| {
matches!(m.ty, ModuleType::Conjunction(_)) && m.outputs.len() == 1 && m.outputs[0] == rx
})
.exactly_one()
.map_err(|_| Error::InvalidInput("expected a single conjunction to wire into rx"))?;
let conjunction_range = match &modules[conjunction_idx].ty {
ModuleType::Conjunction(range) => range.clone(),
_ => unreachable!(),
};
let conjunction_ident = Ident(conjunction_idx as u8);
// During various button presses, it'll toggle on and off one of the inputs,
// to the conjunction that wires into rx. We keep track of during which
// button presses this happens, and then take the least-common-multiple to
// calculate the button press during which all of the inputs will be true.
let mut state_switches = vec![None; conjunction_range.len()];
let mut button_presses = 0;
loop {
button_presses += 1;
pulses.push_back((false, broadcaster, broadcaster));
while let Some((hi, source, target)) = pulses.pop_front() {
let module = &modules[target.0 as usize];
let output = match &module.ty {
ModuleType::None => hi,
&ModuleType::FlipFlop(state) if !hi => {
let last_state = states.get_mut(state as usize).unwrap();
let new_state = !*last_state;
last_state.commit(new_state);
new_state
}
ModuleType::Conjunction(state_range) => {
let input_idx = module.inputs.iter().position(|&m| m == source).unwrap();
let states = &mut states[state_range.start as usize..state_range.end as usize];
if target == conjunction_ident && states[input_idx] != hi {
let state = &mut state_switches[input_idx];
if state.is_none() {
*state = Some(button_presses);
if state_switches.iter().all(|v| v.is_some()) {
return Ok((state_switches.iter())
.map(|v| v.unwrap())
.fold(1, |a, v| a.lcm(&v)));
}
}
}
states.set(input_idx, hi);
!states.all()
}
_ => continue,
};
pulses.extend(module.outputs.iter().map(|&out| (output, target, out)));
}
}
}
fn parse(input: &[u8]) -> Result<Vec<ParseModule>> {
use parsers::*;
let module_type = token((b'%', ParseModuleType::FlipFlop))
.or(token((b'&', ParseModuleType::Conjunction)))
.or(constant(ParseModuleType::None));
let name = take_while((), |_, c| c.is_ascii_alphabetic());
let targets = name.sep_by(token(b", "));
let module = module_type.and(name).and(token(b" -> ").then(targets)).map(
|((module_type, name), outputs)| ParseModule {
ty: module_type,
name,
outputs,
},
);
module.sep_by(token(b'\n')).execute(input)
}
tests! {
const EXAMPLE1: &'static [u8] = b"\
broadcaster -> a, b, c
%a -> b
%b -> c
%c -> inv
&inv -> a";
const EXAMPLE2: &'static [u8] = b"\
broadcaster -> a
%a -> inv, con
&inv -> b
%b -> con
&con -> output";
test_pt!(parse, pt1,
EXAMPLE1 => MulOutput([8000, 4000]),
EXAMPLE2 => MulOutput([4250, 2750]),
);
// test_pt!(parse, pt2, EXAMPLE => 5);
}