generated from fspoettel/advent-of-code-rust
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path07.rs
235 lines (207 loc) · 6.55 KB
/
07.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
use std::collections::HashSet;
use itertools::Itertools;
use rayon::iter::{IntoParallelRefIterator, ParallelIterator};
advent_of_code::solution!(7);
#[derive(Debug, Eq, Hash, PartialEq, Clone)]
struct Equation {
target: i64,
numbers: Vec<i64>,
}
pub fn part_one(input: &str) -> Option<i64> {
let equations = input
.lines()
.map(|line| {
let (target_str, numbers_str) = line.split_once(": ").unwrap();
let numbers: Vec<i64> = numbers_str
.split(" ")
.map(|num_str| num_str.parse().unwrap())
.collect_vec();
Equation {
numbers,
target: target_str.parse().unwrap(),
}
})
.collect_vec();
let result: i64 = equations
.par_iter()
.fold_with(0, |acc, eq| {
if solve_equation(eq).is_some() {
acc + eq.target
} else {
acc
}
})
.sum();
Some(result)
}
fn solve_equation(equation: &Equation) -> Option<HashSet<Vec<char>>> {
let mut solutions = HashSet::new();
if equation.numbers.len() == 2 {
if equation.numbers[0] + equation.numbers[1] == equation.target {
solutions.insert(vec!['+']);
};
if equation.numbers[0] * equation.numbers[1] == equation.target {
solutions.insert(vec!['*']);
};
return if solutions.is_empty() {
None
} else {
Some(solutions)
};
}
let mut numbers_clone = equation.numbers.clone();
let last = numbers_clone.pop().unwrap();
if last < equation.target {
let add_eq_target = equation.target - last;
let add_smaller_eq = Equation {
target: add_eq_target,
numbers: numbers_clone.clone(),
};
let add_smaller_solutions = solve_equation(&add_smaller_eq);
if let Some(sols) = add_smaller_solutions {
for sol in sols {
let mut new_sol = sol.clone();
new_sol.push('+');
solutions.insert(new_sol);
}
}
}
if equation.target % last == 0 {
let mult_eq_target = equation.target / last;
let mult_smaller_eq = Equation {
target: mult_eq_target,
numbers: numbers_clone.clone(),
};
let mult_smaller_solutions = solve_equation(&mult_smaller_eq);
if let Some(sols) = mult_smaller_solutions {
for sol in sols {
let mut new_sol = sol.clone();
new_sol.push('*');
solutions.insert(new_sol);
}
};
}
if solutions.is_empty() {
None
} else {
Some(solutions)
}
}
pub fn part_two(input: &str) -> Option<i64> {
let equations = input
.lines()
.map(|line| {
let (target_str, numbers_str) = line.split_once(": ").unwrap();
let numbers: Vec<i64> = numbers_str
.split(" ")
.map(|num_str| num_str.parse().unwrap())
.collect_vec();
Equation {
numbers,
target: target_str.parse().unwrap(),
}
})
.collect_vec();
let result: i64 = equations
.par_iter()
.fold_with(0, |acc, eq| {
if solve_equation_2(eq).is_some() {
acc + eq.target
} else {
acc
}
})
.sum();
Some(result)
}
fn solve_equation_2(equation: &Equation) -> Option<HashSet<Vec<char>>> {
let mut solutions = HashSet::new();
if equation.numbers.len() == 2 {
if equation.numbers[0] + equation.numbers[1] == equation.target {
solutions.insert(vec!['+']);
};
if equation.numbers[0] * equation.numbers[1] == equation.target {
solutions.insert(vec!['*']);
};
let concat = format!("{}{}", equation.numbers[0], equation.numbers[1])
.parse::<i64>()
.unwrap();
if concat == equation.target {
solutions.insert(vec!['|']);
};
return if solutions.is_empty() {
None
} else {
Some(solutions)
};
}
let mut numbers_clone = equation.numbers.clone();
let last = numbers_clone.pop().unwrap();
if last < equation.target {
let add_eq_target = equation.target - last;
let add_smaller_eq = Equation {
target: add_eq_target,
numbers: numbers_clone.clone(),
};
let add_smaller_solutions = solve_equation_2(&add_smaller_eq);
if let Some(sols) = add_smaller_solutions {
for sol in sols {
let mut new_sol = sol.clone();
new_sol.push('+');
solutions.insert(new_sol);
}
}
};
if equation.target % last == 0 {
let mult_eq_target = equation.target / last;
let mult_smaller_eq = Equation {
target: mult_eq_target,
numbers: numbers_clone.clone(),
};
let mult_smaller_solutions = solve_equation_2(&mult_smaller_eq);
if let Some(sols) = mult_smaller_solutions {
for sol in sols {
let mut new_sol = sol.clone();
new_sol.push('*');
solutions.insert(new_sol);
}
};
};
let target_as_str = equation.target.to_string();
if target_as_str.ends_with(&last.to_string()) {
let new_target = &target_as_str[..target_as_str.len() - last.to_string().len()];
if !new_target.is_empty() {
let concat_smaller_eq = Equation {
target: new_target.parse().unwrap(),
numbers: numbers_clone.clone(),
};
let concat_smaller_solutions = solve_equation_2(&concat_smaller_eq);
if let Some(sols) = concat_smaller_solutions {
for sol in sols {
let mut new_sol = sol.clone();
new_sol.push('|');
solutions.insert(new_sol);
}
};
};
};
if solutions.is_empty() {
None
} else {
Some(solutions)
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_part_one() {
let result = part_one(&advent_of_code::template::read_file("examples", DAY));
assert_eq!(result, Some(3749));
}
#[test]
fn test_part_two() {
let result = part_two(&advent_of_code::template::read_file("examples", DAY));
assert_eq!(result, Some(11387));
}
}