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
|
mod utils;
use std::ops::RangeInclusive;
use utils::{iter_pair, read_input};
fn main() {
let input = read_input();
let pairs = input.lines().map(|x| {
iter_pair(x.split(',').map(|x| -> RangeInclusive<usize> {
let (start, end) = iter_pair(x.split('-'));
start.parse().unwrap()..=end.parse().unwrap()
}))
});
let (fully_contains, partially_contains) = pairs
.map(|(a, b)| (fully_overlap(&a, &b), partially_overlap(&a, &b)))
.fold((0, 0), |(acc_full, acc_part), (full, part)| {
(acc_full + full as usize, acc_part + part as usize)
});
println!("Part 1: {}", fully_contains);
println!("Part 2: {}", partially_contains);
}
#[inline(always)]
fn fully_overlap<T: PartialOrd>(a: &RangeInclusive<T>, b: &RangeInclusive<T>) -> bool {
(a.contains(b.start()) && a.contains(b.end())) || (b.contains(a.start()) && b.contains(a.end()))
}
#[inline(always)]
fn partially_overlap<T: PartialOrd>(a: &RangeInclusive<T>, b: &RangeInclusive<T>) -> bool {
a.contains(b.start()) || a.contains(b.end()) || b.contains(a.start()) || b.contains(a.end())
}
|
