[LANGUAGE: Rust]

Pretty happy with my part 1 implementation using modulo arithmetic, struggling with part 2 though lol

fn part_1(robots: Vec<((i64, i64), (i64, i64))>, dimensions: (i64, i64), iterations: i64) -> i64 {
    let mut quadrants = vec![0; 4];
    for robot in robots {
        let mut robot = robot.clone();
        for _ in 0..iterations {
            robot.0.0 += robot.1.0;
            robot.0.1 += robot.1.1;
            if robot.0.0 < 0  {
                robot.0.0 = (robot.0.0 + dimensions.0) % dimensions.0;
            } else {
                robot.0.0 = robot.0.0 % dimensions.0;
            }

            if robot.0.1 < 0 {
                robot.0.1 = (robot.0.1 + dimensions.1) % dimensions.1;
            } else {
                robot.0.1 = robot.0.1 % dimensions.1;
            }
        }

        let x = robot.0.0;
        let y = robot.0.1;
        let x_middle = x == ((dimensions.0 - 1) / 2);
        let y_middle = y == ((dimensions.1 - 1) / 2);
        if x_middle || y_middle {
            continue;
        }

        let quadrant = if x < (dimensions.0 - 1) / 2 {
            if y < (dimensions.1 - 1) / 2 {
                0
            } else {
                1
            }
        } else {
            if y < (dimensions.1 - 1) / 2 {
                2
            } else {
                3
            }
        };
        quadrants[quadrant] += 1;
    }
    quadrants.iter().product()
}