Struct Day18 

pub struct Day18 { /* private fields */ }

2019 Day 18: Finding the shortest path to collect every key.

The key optimization is to precompute the distance between all entrances and keys, along with the keys required to travel each path. This allows the final search to only track each robot’s position and which keys remain.

Implementations

impl Day18

pub fn new(input: &str, _: InputType) -> Result<Self, InputError>

pub fn part1(&self) -> u32

pub fn part2(&self) -> u32

Trait Implementations

impl Clone for Day18

fn clone(&self) -> Day18

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Day18

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PuzzleDate for Day18

const DATE: Date

2019 Day 18

impl PuzzleExamples<u32, u32> for Day18

const EXAMPLES: &'static [(&'static str, Option<u32>, Option<u32>)]