ktims/aoc2024
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

day19: clippies
All checks were successful
test / AoC 2024 (push) Successful in 3m25s
Details

Browse Source
This commit is contained in:
Keenan Tims 2024-12-18 22:45:05 -08:00
parent 65d498f168
commit 6b6dededc2
Signed by: ktims
GPG Key ID: 11230674D69038D4
1 changed files with 19 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

40
src/day19.rs
View File

@ -1,11 +1,7 @@
use aoc_runner_derive::aoc; use aoc_runner_derive::aoc;
use cached::proc_macro::cached;
use itertools::Itertools; use itertools::Itertools;
use rustc_hash::{FxHashMap, FxHasher}; use rustc_hash::FxHashMap;
use std::{ use std::fmt::{Display, Write};
collections::VecDeque,
fmt::{Display, Write},
};
#[repr(u8)] #[repr(u8)]
#[derive(Clone, Copy, Debug, Eq, PartialEq, Hash)] #[derive(Clone, Copy, Debug, Eq, PartialEq, Hash)]
@ -30,9 +26,9 @@ impl From<&u8> for Stripe {
} }
} }
impl Into<char> for &Stripe { impl From<&Stripe> for char {
fn into(self) -> char { fn from(val: &Stripe) -> Self {
let v = *self as u8; let v = *val as u8;
v.into() v.into()
} }
} }
@ -68,7 +64,6 @@ impl Display for Design {
struct Onsen { struct Onsen {
towels: Vec<Design>, towels: Vec<Design>,
designs: Vec<Design>, designs: Vec<Design>,
// ways_cache: FxHashMap<&'a [Stripe], i64>
} }
impl Display for Onsen { impl Display for Onsen {
@ -86,22 +81,23 @@ impl Display for Onsen {
impl Onsen { impl Onsen {
fn possible(&self, d: &[Stripe]) -> bool { fn possible(&self, d: &[Stripe]) -> bool {
if d.len() == 0 { if d.is_empty() {
return true; return true;
} }
for t in &self.towels { for t in &self.towels {
if d.starts_with(&t.stripes) { if d.starts_with(&t.stripes) && self.possible(d.split_at(t.stripes.len()).1) {
if self.possible(d.split_at(t.stripes.len()).1) {
return true; return true;
} }
} }
}
false false
} }
// Count the ways to construct a given substring // Count the ways to construct a given substring
fn ways<'a>(&'a self, d: &'a [Stripe], mut cache: FxHashMap<&'a [Stripe], i64>) -> (FxHashMap<&'a [Stripe], i64>, i64) { fn ways<'a>(
if d.len() == 0 { &'a self,
// println!("ways to make {} - 0", d.iter().join("")); d: &'a [Stripe],
mut cache: FxHashMap<&'a [Stripe], i64>,
) -> (FxHashMap<&'a [Stripe], i64>, i64) {
if d.is_empty() {
return (cache, 1); return (cache, 1);
} }
if cache.contains_key(d) { if cache.contains_key(d) {
@ -117,7 +113,6 @@ impl Onsen {
count += res_count; count += res_count;
} }
} }
// println!("ways to make {} - {}", d.iter().join(""), count);
cache.insert(d, count); cache.insert(d, count);
(cache, count) (cache, count)
} }
@ -129,7 +124,10 @@ impl Onsen {
.count() as i64 .count() as i64
} }
fn count_ways(&self) -> i64 { fn count_ways(&self) -> i64 {
self.designs.iter().map(|d| self.ways(&d.stripes, FxHashMap::default()).1).sum::<i64>() self.designs
.iter()
.map(|d| self.ways(&d.stripes, FxHashMap::default()).1)
.sum::<i64>()
} }
} }
@ -143,6 +141,7 @@ fn parse(input: &str) -> Onsen {
.filter(|s| !s.is_empty()) .filter(|s| !s.is_empty())
.map(|s| s.as_bytes().into()) .map(|s| s.as_bytes().into())
.collect(); .collect();
lines.next().unwrap(); // discard empty line lines.next().unwrap(); // discard empty line
let designs = lines.map(|l| l.as_bytes().into()).collect(); let designs = lines.map(|l| l.as_bytes().into()).collect();
@ -177,9 +176,6 @@ ubwu
bwurrg bwurrg
brgr brgr
bbrgwb"; bbrgwb";
const EXAMPLE2: &str = "r, wr, b, g, bwu, rb, gb, br
rrbgbr";
#[test] #[test]
fn part1_example() { fn part1_example() {