Gobidev/adventofcode2024
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Clean up day14

Browse Source
This commit is contained in:
Adrian Groh 2024-12-14 12:07:37 +01:00
parent b99474d071
commit 6d4312ccd4
Signed by: Gobidev
GPG Key ID: 3AA3153E98B0D771
1 changed files with 20 additions and 41 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

61
day14/src/main.rs
View File

@ -26,29 +26,7 @@ fn parse(input: &str) -> Vec<Robot> {
} }
fn get_pos_after_steps(robot: &Robot, steps: &i32, dimensions: &IVec2) -> IVec2 { fn get_pos_after_steps(robot: &Robot, steps: &i32, dimensions: &IVec2) -> IVec2 {
let p = robot.position + steps * robot.velocity; (robot.position + steps * robot.velocity).rem_euclid(*dimensions)
let mut res = IVec2::new(0, 0);
if p.x >= 0 {
res.x = p.x % dimensions.x;
} else {
let diff = p.x.abs() % dimensions.x;
if diff == 0 {
res.x = 0;
} else {
res.x = dimensions.x - diff;
}
}
if p.y >= 0 {
res.y = p.y % dimensions.y;
} else {
let diff = p.y.abs() % dimensions.y;
if diff == 0 {
res.y = 0;
} else {
res.y = dimensions.y - diff;
}
}
res
} }
fn part1(input: &[Robot], dimensions: &IVec2) -> usize { fn part1(input: &[Robot], dimensions: &IVec2) -> usize {
@ -74,24 +52,24 @@ fn part1(input: &[Robot], dimensions: &IVec2) -> usize {
.product() .product()
} }
// fn print_map(robots: &[Robot], dimensions: &IVec2) -> String { fn print_map(robots: &[Robot], dimensions: &IVec2) -> String {
// let mut res = String::new(); let mut res = String::new();
// for y in 0..dimensions.x { for y in 0..dimensions.x {
// for x in 0..dimensions.y { for x in 0..dimensions.y {
// if robots if robots
// .iter() .iter()
// .map(|r| (r.position.x, r.position.y)) .map(|r| (r.position.x, r.position.y))
// .any(|p| p == (x, y)) .any(|p| p == (x, y))
// { {
// res.push('#'); res.push('#');
// } else { } else {
// res.push(' '); res.push(' ');
// } }
// } }
// res.push('\n'); res.push('\n');
// } }
// res res
// } }
fn has_tree(robots: &[Robot]) -> bool { fn has_tree(robots: &[Robot]) -> bool {
let check: Vec<_> = (0..8).map(|i| IVec2::new(i, 0)).collect(); let check: Vec<_> = (0..8).map(|i| IVec2::new(i, 0)).collect();
@ -105,6 +83,7 @@ fn has_tree(robots: &[Robot]) -> bool {
fn part2(robots: &mut [Robot], dimensions: &IVec2) -> i32 { fn part2(robots: &mut [Robot], dimensions: &IVec2) -> i32 {
for i in 0.. { for i in 0.. {
if has_tree(robots) { if has_tree(robots) {
eprintln!("{}", print_map(robots, dimensions));
return i; return i;
} }
robots robots