alarsyo/advent-of-code
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

2021: day17: better bounds for part 1

Browse source
This commit is contained in:
Antoine Martin 2021-12-17 18:39:49 +01:00
parent 551f57f7ff
commit 2bc1b97c2d
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
aoc2021/src/day17.rs
View file

@ -42,8 +42,8 @@ fn part1(input: &str) -> Result<isize> {
let (min_x_vel, max_x_vel) = (min_x_vel.min(max_x_vel), min_x_vel.max(max_x_vel));
// we could launch the prob downward, but in that case max Y reached would always be 0
let min_y_vel = 0;
let max_y_vel = 5000; // idk
let min_y_vel = 1;
let max_y_vel = area.min_y().abs();
(min_x_vel..=max_x_vel)
.flat_map(|x_vel| (min_y_vel..=max_y_vel).map(move |y_vel| (x_vel, y_vel)))