blob: becae3b4d44b382bf56379fbc06482d8a871748e (
plain) (
blame)
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
|
use advent_of_code::prelude::*;
const WINDOW: usize = 25;
pub fn parse(fh: File) -> Result<Vec<u64>> {
Ok(parse::lines(fh).collect())
}
pub fn part1(list: Vec<u64>) -> Result<u64> {
for i in 0..(list.len() - WINDOW) {
let set = &list[i..i + WINDOW];
let n = list[i + WINDOW];
if !valid(set, n) {
return Ok(n);
}
}
Err(anyhow!("failed to find invalid number"))
}
pub fn part2(list: Vec<u64>) -> Result<u64> {
let mut invalid = None;
for i in 0..(list.len() - WINDOW) {
let set = &list[i..i + WINDOW];
let n = list[i + WINDOW];
if !valid(set, n) {
invalid = Some(n);
}
}
if invalid.is_none() {
return Err(anyhow!("failed to find invalid number"));
}
let invalid = invalid.unwrap();
for i in 0..list.len() {
for j in i..list.len() {
let seq = &list[i..=j];
if invalid == seq.iter().sum() {
return Ok(seq.iter().copied().min().unwrap()
+ seq.iter().copied().max().unwrap());
}
}
}
Err(anyhow!("failed to find sequence summing to invalid number"))
}
fn valid(set: &[u64], n: u64) -> bool {
for i in 0..set.len() {
for j in 0..set.len() {
if i == j {
continue;
}
let i = set[i];
let j = set[j];
if i + j == n {
return true;
}
}
}
false
}
#[test]
fn test() {
assert_eq!(
part1(parse(parse::data(2020, 9).unwrap()).unwrap()).unwrap(),
373803594
);
assert_eq!(
part2(parse(parse::data(2020, 9).unwrap()).unwrap()).unwrap(),
51152360
);
}
|
