advent-of-code/2023/src/bin/day18.rs
2023-12-18 14:57:40 +01:00

93 lines
2.1 KiB
Rust

#![feature(test)]
extern crate test;
use aoc2023::{
boilerplate,
common::*,
direction::Direction::{self, *},
position::{Position2D, PositionND},
};
use itertools::Itertools;
use std::ops::Div;
const DAY: usize = 18;
type I = isize;
type Pos = Position2D<I>;
type Parsed = Vec<(Direction, I, u32)>;
fn parse_input(raw: &str) -> Parsed {
raw.lines()
.map(|line| line.split(' ').collect_tuple().unwrap())
.map(|(d, l, c)| {
let dir = match d {
"R" => Right,
"D" => Down,
"U" => Up,
"L" => Left,
_ => unreachable!(),
};
(dir, parse_num(l), u32::from_str_radix(&c[2..8], 16).unwrap())
})
.collect()
}
fn part1(instructions: &Parsed) -> isize {
let n_points: I = instructions.iter().map(|(_, len, _)| len).sum();
let points: Vec<_> = instructions
.iter()
.scan(PositionND([0, 0]), |pos, &(dir, len, _)| {
let movement = PositionND(match dir {
Up => [len, 0],
Down => [-len, 0],
Right => [0, len],
Left => [0, -len],
});
*pos += movement;
Some(*pos)
})
.collect();
(2 * area(&points) - n_points + 2) / 2 + n_points
}
fn area(polygon: &[Pos]) -> isize {
polygon.iter().zip(polygon.iter().cycle().skip(1)).map(|(p1, p2)| p1[0] * p2[1] - p1[1] * p2[0]).sum::<I>().abs().div(2)
}
fn part2(parsed: &Parsed) -> usize {
unimplemented!()
}
boilerplate! {
TEST_INPUT == "\
R 6 (#70c710)
D 5 (#0dc571)
L 2 (#5713f0)
D 2 (#d2c081)
R 2 (#59c680)
D 2 (#411b91)
L 5 (#8ceee2)
U 2 (#caa173)
L 1 (#1b58a2)
U 2 (#caa171)
R 2 (#7807d2)
U 3 (#a77fa3)
L 2 (#015232)
U 2 (#7a21e3)"
for tests: {
part1: { TEST_INPUT => 62 },
part2: { TEST_INPUT => 0 },
},
unittests: {
area: {
&[
PositionND([0, 0]),
PositionND([0, 2]),
PositionND([2, 2]),
PositionND([2, 0]),
] => 4
}
},
bench1 == 35991,
bench2 == 0,
bench_parse: Vec::len => 602,
}