-
Notifications
You must be signed in to change notification settings - Fork 0
/
day19.rs
290 lines (262 loc) · 7.57 KB
/
day19.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
use crate::data::load;
use regex::Regex;
use std::{collections::HashMap, num::ParseIntError};
use thiserror::Error;
#[derive(Error, Debug, PartialEq, Eq)]
pub enum PuzzleErr {
#[error("Input parsing error: {}.", .0)]
ParseInputError(String),
#[error("Integer parsing error: {:?}.", .0)]
ParseIntError(#[from] ParseIntError),
#[error("Not yet implemented.")]
NotImplemented,
}
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
struct Part {
x: u32,
m: u32,
a: u32,
s: u32,
}
impl TryFrom<&str> for Part {
type Error = PuzzleErr;
fn try_from(value: &str) -> Result<Self, Self::Error> {
let re = Regex::new(r"x=(?<x>\d+),m=(?<m>\d+),a=(?<a>\d+),s=(?<s>\d+)").unwrap();
let Some(caps) = re.captures(value) else {
return Err(PuzzleErr::ParseInputError(value.to_string()));
};
Ok(Self {
x: caps["x"].parse()?,
m: caps["m"].parse()?,
a: caps["a"].parse()?,
s: caps["s"].parse()?,
})
}
}
impl Part {
fn sum(&self) -> u32 {
self.x + self.a + self.m + self.s
}
}
#[derive(Debug, Clone, PartialEq, Eq)]
enum RuleResult {
A,
R,
W(String),
}
impl From<&str> for RuleResult {
fn from(value: &str) -> Self {
match value {
"A" => Self::A,
"R" => Self::R,
x => Self::W(x.to_string()),
}
}
}
#[derive(Debug, Clone, PartialEq, Eq)]
enum CompOp {
Greater,
Less,
}
impl TryFrom<&str> for CompOp {
type Error = PuzzleErr;
fn try_from(value: &str) -> Result<Self, Self::Error> {
match value {
"<" => Ok(CompOp::Less),
">" => Ok(CompOp::Greater),
_ => Err(PuzzleErr::ParseInputError(value.to_string())),
}
}
}
#[derive(Debug, Clone, PartialEq, Eq)]
enum PartComponent {
X,
M,
A,
S,
}
impl TryFrom<&str> for PartComponent {
type Error = PuzzleErr;
fn try_from(value: &str) -> Result<Self, Self::Error> {
match value {
"x" => Ok(PartComponent::X),
"m" => Ok(PartComponent::M),
"a" => Ok(PartComponent::A),
"s" => Ok(PartComponent::S),
_ => Err(PuzzleErr::ParseInputError(value.to_string())),
}
}
}
#[derive(Debug, Clone, PartialEq, Eq)]
struct ComparisonOperation {
var_name: PartComponent,
op: CompOp,
value: u32,
}
impl ComparisonOperation {
fn execute(&self, part: &Part) -> bool {
let part_val = match self.var_name {
PartComponent::X => part.x,
PartComponent::M => part.m,
PartComponent::A => part.a,
PartComponent::S => part.s,
};
match self.op {
CompOp::Greater => part_val > self.value,
CompOp::Less => part_val < self.value,
}
}
}
#[derive(Debug, Clone, PartialEq, Eq)]
enum Rule {
Comparison {
op: ComparisonOperation,
res: RuleResult,
},
Simple(RuleResult),
}
impl Rule {
fn execute(&self, part: &Part) -> Option<RuleResult> {
match self {
Rule::Simple(res) => Some(res.clone()),
Rule::Comparison { op, res } => {
if op.execute(part) {
Some(res.clone())
} else {
None
}
}
}
}
}
impl TryFrom<&str> for Rule {
type Error = PuzzleErr;
fn try_from(value: &str) -> Result<Self, Self::Error> {
if !(value.contains('<') | value.contains('>')) {
let res = RuleResult::from(value);
return Ok(Rule::Simple(res));
}
// a<2006:qkq
let re =
Regex::new(r"(?<var_name>\w)(?<op_name>[<|>])(?<value>\d+):(?<res_name>\w+)").unwrap();
let Some(caps) = re.captures(value) else {
return Err(PuzzleErr::ParseInputError(value.to_string()));
};
let op = ComparisonOperation {
var_name: PartComponent::try_from(&caps["var_name"])?,
op: CompOp::try_from(&caps["op_name"])?,
value: caps["value"].parse()?,
};
let res = RuleResult::from(&caps["res_name"]);
Ok(Rule::Comparison { op, res })
}
}
#[derive(Debug, Clone, PartialEq, Eq)]
struct Workflow {
name: String,
rules: Vec<Rule>,
}
impl TryFrom<&str> for Workflow {
type Error = PuzzleErr;
fn try_from(value: &str) -> Result<Self, Self::Error> {
let re = Regex::new(r"^(?<name>\w+)\{(?<rules>.+)\}").unwrap();
let Some(caps) = re.captures(value) else {
return Err(PuzzleErr::ParseInputError(value.to_string()));
};
let rules = &caps["rules"]
.split(',')
.map(Rule::try_from)
.collect::<Result<Vec<Rule>, PuzzleErr>>()?;
Ok(Self {
name: caps["name"].to_string(),
rules: rules.clone(),
})
}
}
impl Workflow {
fn execute(&self, part: &Part) -> RuleResult {
for rule in self.rules.iter() {
if let Some(res) = rule.execute(part) {
return res;
}
}
unreachable!();
}
}
fn parse_workflows(input: &str) -> Result<Vec<Workflow>, PuzzleErr> {
input
.trim()
.lines()
.map(Workflow::try_from)
.collect::<Result<Vec<Workflow>, PuzzleErr>>()
}
fn parse_parts(input: &str) -> Result<Vec<Part>, PuzzleErr> {
input
.trim()
.lines()
.map(Part::try_from)
.collect::<Result<Vec<Part>, PuzzleErr>>()
}
fn parse_input(input: &str) -> Result<(Vec<Workflow>, Vec<Part>), PuzzleErr> {
let split_input = input.trim().split("\n\n").collect::<Vec<_>>();
let workflows = parse_workflows(split_input[0])?;
let parts = parse_parts(split_input[1])?;
Ok((workflows, parts))
}
fn organize_part(part: &Part, workflows: &HashMap<&str, Workflow>) -> RuleResult {
let mut workflow_name = "in".to_string();
loop {
let w: &Workflow = workflows.get(workflow_name.as_str()).unwrap();
let res = w.execute(part);
workflow_name = match res {
RuleResult::A | RuleResult::R => return res,
RuleResult::W(next_w) => next_w,
};
}
}
fn organize_parts(parts: &[Part], workflows: &HashMap<&str, Workflow>) -> u32 {
parts
.iter()
.filter_map(|p| {
if organize_part(p, workflows) == RuleResult::A {
Some(p.sum())
} else {
None
}
})
.sum()
}
pub fn puzzle_1(input: &str) -> Result<u32, PuzzleErr> {
let (workflows, parts) = parse_input(input)?;
let workflows_map = workflows
.iter()
.map(|w| (w.name.as_str(), w.clone()))
.collect::<HashMap<&str, Workflow>>();
Ok(organize_parts(&parts, &workflows_map))
}
pub fn puzzle_2(input: &str) -> Result<u32, PuzzleErr> {
let (workflows, parts) = parse_input(input)?;
let workflows_map = workflows
.iter()
.map(|w| (w.name.as_str(), w.clone()))
.collect::<HashMap<&str, Workflow>>();
Ok(organize_parts(&parts, &workflows_map))
}
pub fn main(data_dir: &str) {
println!("Day 19: Aplenty");
let data = load(data_dir, 19, None);
// Puzzle 1.
let answer_1 = puzzle_1(&data);
match answer_1 {
Ok(x) => println!(" Puzzle 1: {}", x),
Err(e) => panic!("No solution to puzzle 1: {}.", e),
}
assert_eq!(answer_1, Ok(509597));
// Puzzle 2.
// let answer_2 = puzzle_2(&data);
// match answer_2 {
// Ok(x) => println!(" Puzzle 2: {}", x),
// Err(e) => panic!("No solution to puzzle 2: {}", e),
// }
// assert_eq!(answer_2, Ok(30449))
}