2022 - Day 5

This commit is contained in:
2022-12-06 00:30:08 +01:00
parent 119d172891
commit 381ecb2f85
4 changed files with 712 additions and 0 deletions

189
2022/src/bin/day5.rs Normal file
View File

@@ -0,0 +1,189 @@
use core::fmt;
use std::collections::HashMap;
use lazy_static::lazy_static;
use regex::Regex;
use anyhow::Result;
use aoc::{Solver, Output};
// -- Runners --
fn main() -> Result<()> {
Day::solve()
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn part1_test1() -> Result<()> {
Day::test(aoc::Part::ONE, "test-1", Output::String("CMZ".to_string()))
}
#[test]
fn part2_test1() -> Result<()> {
Day::test(aoc::Part::TWO, "test-1", Output::String("MCD".to_string()))
}
#[test]
fn part1_solution() -> Result<()> {
Day::test(aoc::Part::ONE, "input", Output::String("RNZLFZSJH".to_string()))
}
#[test]
fn part2_solution() -> Result<()> {
Day::test(aoc::Part::TWO, "input", Output::String("CNSFCGJSM".to_string()))
}
}
// -- Implementation --
#[derive(Debug)]
struct Crate{
letter: char,
}
#[derive(Debug)]
struct Boat{
stacks: HashMap<usize, Vec<Crate>>,
}
impl fmt::Display for Boat {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
for i in 0..self.stacks.len() {
match self.top(i+1) {
Some(cr) => write!(f, "{}", cr.letter)?,
None => panic!("No crate in stack")
}
}
Ok(())
}
}
impl Boat {
fn new(lines: &Vec<&str>) -> Boat {
lazy_static! {
static ref RE: Regex = Regex::new(r"\[[A-Z]\]").unwrap();
}
let mut boat = Boat{stacks: HashMap::new()};
for line in lines {
for mat in RE.find_iter(line) {
let index = mat.start() / 4 + 1;
// based on the pattern [.] we get the second char
let letter = mat.as_str().chars().nth(1).unwrap();
boat.push(index, Crate{letter});
}
}
// Because of how we load the data, each stack is upside down
boat.reverse();
return boat;
}
fn push(&mut self, index: usize, cr: Crate) {
let stack = self.stacks.entry(index).or_insert(vec![]);
stack.push(cr);
}
fn pop(&mut self, index: usize) -> Option<Crate> {
let stack = match self.stacks.get_mut(&index) {
Some(s) => s,
None => return None,
};
stack.pop()
}
fn top(&self, index: usize) -> Option<&Crate> {
let stack = match self.stacks.get(&index) {
Some(s) => s,
None => return None,
};
stack.last()
}
fn reverse(&mut self) {
for stack in self.stacks.iter_mut() {
stack.1.reverse()
}
}
}
// -- Helpers --
fn parse_instruction(s: &str) -> (usize, usize, usize) {
lazy_static! {
static ref RE: Regex = Regex::new(r"move (?P<amount>[0-9]+) from (?P<from>[0-9]) to (?P<to>[0-9])").unwrap();
}
let capture = RE.captures(s).unwrap();
let parse_number = |name| capture.name(name).unwrap().as_str().parse::<usize>().unwrap();
let amount: usize = parse_number("amount");
let from: usize = parse_number("from");
let to: usize = parse_number("to");
(amount, from, to)
}
// -- Solution --
pub struct Day;
impl aoc::Solver for Day {
fn day() -> u8 {
5
}
fn part1(input: &str) -> Output {
// The current layout description ends with an empty line
let mut boat = Boat::new(&input
.lines()
.take_while(|line| !line.is_empty())
.collect());
// Each instruction starts with an 'm'
input
.lines()
.skip_while(|line| !line.starts_with('m'))
.map(parse_instruction)
.for_each(|(amount, from, to)| {
for _ in 0..amount {
let cr = boat.pop(from).unwrap();
boat.push(to, cr);
}
});
Output::String(boat.to_string())
}
fn part2(input: &str) -> Output {
// The current layout description ends with an empty line
let mut boat = Boat::new(&input
.lines()
.take_while(|line| !line.is_empty())
.collect());
// Each instruction starts with an 'm'
input
.lines()
.skip_while(|line| !line.starts_with('m'))
.map(parse_instruction)
.for_each(|(amount, from, to)| {
// @TODO Is there a nicer way to do this?
let mut temp = vec![];
for _ in 0..amount {
let cr = boat.pop(from).unwrap();
temp.push(cr);
}
temp.reverse();
for cr in temp {
boat.push(to, cr);
}
});
Output::String(boat.to_string())
}
}