jdkaplan/advent-of-code
Watch
1
0
Fork
You've already forked advent-of-code
 0
Code Issues Activity

Cleanup

Browse source
This commit is contained in:
Jeremy Kaplan 2022-12-15 09:43:13 -08:00
commit d9cd195ba7
1 changed files with 4 additions and 14 deletions
Download patch file Download diff file Expand all files Collapse all files

18
2022/src/bin/day15.rs
View file

@ -48,25 +48,15 @@ struct Beacon {
fn part1(input: &str, yy: i32) -> usize { fn part1(input: &str, yy: i32) -> usize {
let pairs: Vec<(Sensor, Beacon)> = aoc::lines(input).map(parse_line).collect(); let pairs: Vec<(Sensor, Beacon)> = aoc::lines(input).map(parse_line).collect();
let relevant: Vec<(Sensor, Beacon)> = pairs
.iter()
.cloned()
.filter(|(s, b)| {
let d_cover = s.pos.distance(b.pos);
let dy = s.pos.distance(Pos::new(s.pos.x, yy));
dy <= d_cover
})
.collect();
let mut coverage: HashSet<Pos> = HashSet::new(); let mut coverage: HashSet<Pos> = HashSet::new();
for (s, b) in relevant { for (s, b) in &pairs {
let d_cover = s.pos.distance(b.pos); let d_cover = s.pos.distance(b.pos);
let d_line = s.pos.distance(Pos::new(s.pos.x, yy)); let dy = s.pos.distance(Pos::new(s.pos.x, yy));
let w_line = d_cover - d_line; let width = d_cover - dy;
let x = s.pos.x; let x = s.pos.x;
for dx in 0..=w_line { for dx in 0..=width {
coverage.insert(Pos::new(x + dx, yy)); coverage.insert(Pos::new(x + dx, yy));
coverage.insert(Pos::new(x - dx, yy)); coverage.insert(Pos::new(x - dx, yy));
} }