Struct Day20 

pub struct Day20 { /* private fields */ }

2019 Day 20: Finding the shortest paths through a recursive maze.

Similar to Day 18, the key optimization is to precompute distances between every portal.

Implementations

impl Day20

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

pub fn part1(&self) -> u32

pub fn part2(&self) -> u32

Trait Implementations

impl Clone for Day20

fn clone(&self) -> Day20

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Day20

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

Formats the value using the given formatter.

impl PuzzleDate for Day20

const DATE: Date

2019 Day 20

impl PuzzleExamples<u32, u32> for Day20

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