summaryrefslogtreecommitdiffstats
path: root/src/bin
diff options
context:
space:
mode:
authorJesse Luehrs <doy@tozt.net>2022-12-25 00:43:42 -0500
committerJesse Luehrs <doy@tozt.net>2022-12-25 00:43:42 -0500
commit18202694cfc4c715de7dab36639373f9deb1abe3 (patch)
tree37e873cb1448df5e623bfdbdd4ce633421f96e7d /src/bin
parent67515a357519a3c2fac699ba2e8c56e671b651c5 (diff)
downloadadvent-of-code-18202694cfc4c715de7dab36639373f9deb1abe3.tar.gz
advent-of-code-18202694cfc4c715de7dab36639373f9deb1abe3.zip
day 22 part 1
Diffstat (limited to 'src/bin')
-rw-r--r--src/bin/2022/day22.rs181
-rw-r--r--src/bin/2022/main.rs18
2 files changed, 191 insertions, 8 deletions
diff --git a/src/bin/2022/day22.rs b/src/bin/2022/day22.rs
new file mode 100644
index 0000000..81bf264
--- /dev/null
+++ b/src/bin/2022/day22.rs
@@ -0,0 +1,181 @@
+#![allow(dead_code)]
+#![allow(unused_variables)]
+
+use advent_of_code::prelude::*;
+
+#[derive(Clone, Copy, Eq, PartialEq, Hash, Debug, Default)]
+enum Tile {
+ Open,
+ Wall,
+ #[default]
+ Noop,
+}
+
+#[derive(Clone, Copy, Eq, PartialEq, Hash, Debug)]
+enum Step {
+ Forward(usize),
+ Left,
+ Right,
+}
+
+#[derive(Clone, Copy, Eq, PartialEq, Hash, Debug)]
+enum Direction {
+ Right,
+ Down,
+ Left,
+ Up,
+}
+
+impl std::convert::From<Direction> for usize {
+ fn from(direction: Direction) -> Self {
+ match direction {
+ Direction::Right => 0,
+ Direction::Down => 1,
+ Direction::Left => 2,
+ Direction::Up => 3,
+ }
+ }
+}
+
+impl Direction {
+ fn left(&self) -> Self {
+ match self {
+ Direction::Right => Direction::Up,
+ Direction::Down => Direction::Right,
+ Direction::Left => Direction::Down,
+ Direction::Up => Direction::Left,
+ }
+ }
+
+ fn right(&self) -> Self {
+ match self {
+ Direction::Right => Direction::Down,
+ Direction::Down => Direction::Left,
+ Direction::Left => Direction::Up,
+ Direction::Up => Direction::Right,
+ }
+ }
+}
+
+#[derive(Debug)]
+pub struct Map {
+ grid: Grid<Tile>,
+ path: Vec<Step>,
+}
+
+impl Map {
+ fn step(&self, pos: (Row, Col), facing: Direction) -> (Row, Col) {
+ let (row_diff, col_diff, sub) = match facing {
+ Direction::Right => (0, 1, false),
+ Direction::Down => (1, 0, false),
+ Direction::Left => (0, 1, true),
+ Direction::Up => (1, 0, true),
+ };
+ let rows = self.grid.rows().0;
+ let cols = self.grid.cols().0;
+ let mut new_pos = pos;
+ new_pos = (
+ if sub {
+ rows + new_pos.0 - row_diff
+ } else {
+ rows + new_pos.0 + row_diff
+ } % rows,
+ if sub {
+ cols + new_pos.1 - col_diff
+ } else {
+ cols + new_pos.1 + col_diff
+ } % cols,
+ );
+ while matches!(self.grid[new_pos.0][new_pos.1], Tile::Noop) {
+ new_pos = (
+ if sub {
+ rows + new_pos.0 - row_diff
+ } else {
+ rows + new_pos.0 + row_diff
+ } % rows,
+ if sub {
+ cols + new_pos.1 - col_diff
+ } else {
+ cols + new_pos.1 + col_diff
+ } % cols,
+ );
+ }
+ if matches!(self.grid[new_pos.0][new_pos.1], Tile::Wall) {
+ pos
+ } else {
+ new_pos
+ }
+ }
+}
+
+pub fn parse(fh: File) -> Result<Map> {
+ let mut lines = parse::raw_lines(fh);
+ let grid = parse::grid(parse::chunk(&mut lines), |c, _, _| match c {
+ b' ' => Tile::Noop,
+ b'.' => Tile::Open,
+ b'#' => Tile::Wall,
+ _ => panic!("invalid map tile {}", c),
+ });
+
+ let path_str = lines.next().unwrap();
+ let mut path_str = &path_str[..];
+ let mut path = vec![];
+ while let Some(first) = path_str.chars().next() {
+ match first {
+ 'R' => {
+ path.push(Step::Right);
+ path_str = &path_str[1..];
+ }
+ 'L' => {
+ path.push(Step::Left);
+ path_str = &path_str[1..];
+ }
+ '0'..='9' => {
+ let prefix_len = path_str
+ .chars()
+ .take_while(|c| ('0'..='9').contains(c))
+ .count();
+ path.push(Step::Forward(
+ path_str[0..prefix_len].parse().unwrap(),
+ ));
+ path_str = &path_str[prefix_len..];
+ }
+ _ => panic!("invalid path char {}", first),
+ }
+ }
+
+ Ok(Map { grid, path })
+}
+
+pub fn part1(map: Map) -> Result<usize> {
+ let mut pos = (Row(0), Col(0));
+ let mut facing = Direction::Right;
+ for step in &map.path {
+ match step {
+ Step::Left => facing = facing.left(),
+ Step::Right => facing = facing.right(),
+ Step::Forward(n) => {
+ for _ in 0..*n {
+ pos = map.step(pos, facing);
+ }
+ }
+ }
+ }
+ Ok((pos.0 .0 + 1) * 1000 + (pos.1 .0 + 1) * 4 + usize::from(facing))
+}
+
+pub fn part2(map: Map) -> Result<usize> {
+ todo!()
+}
+
+#[test]
+fn test() {
+ assert_eq!(
+ part1(parse(parse::data(2022, 22).unwrap()).unwrap()).unwrap(),
+ 95358
+ );
+ // assert_eq!(
+ // part2(parse(parse::data(2022, 22).unwrap()).unwrap()).unwrap(),
+ // 0
+ // );
+}
diff --git a/src/bin/2022/main.rs b/src/bin/2022/main.rs
index 46cc3bb..efc7b22 100644
--- a/src/bin/2022/main.rs
+++ b/src/bin/2022/main.rs
@@ -14,14 +14,6 @@ use advent_of_code::prelude::*;
mod day1;
mod day10;
mod day11;
-mod day2;
-mod day3;
-mod day4;
-mod day5;
-mod day6;
-mod day7;
-mod day8;
-mod day9;
mod day12;
mod day13;
mod day14;
@@ -30,11 +22,20 @@ mod day16;
mod day17;
mod day18;
mod day19;
+mod day2;
mod day20;
mod day21;
+mod day22;
mod day23;
mod day24;
mod day25;
+mod day3;
+mod day4;
+mod day5;
+mod day6;
+mod day7;
+mod day8;
+mod day9;
// NEXT MOD
#[paw::main]
@@ -62,6 +63,7 @@ fn main(opt: Opt) -> Result<()> {
19 => advent_of_code::day!(2022, opt.day, opt.puzzle, day19),
20 => advent_of_code::day!(2022, opt.day, opt.puzzle, day20),
21 => advent_of_code::day!(2022, opt.day, opt.puzzle, day21),
+ 22 => advent_of_code::day!(2022, opt.day, opt.puzzle, day22),
23 => advent_of_code::day!(2022, opt.day, opt.puzzle, day23),
24 => advent_of_code::day!(2022, opt.day, opt.puzzle, day24),
25 => advent_of_code::day!(2022, opt.day, opt.puzzle, day25),