adventofcode2024

Commit Graph

Author	SHA1	Message	Date
magical	ad6279089f	day 10 optimizations - reduce duplicate queue entries by not appending to the queue if a point has a nonzero count. (if there's a count then it must have already been queued.) - use the correct data structure for a double-ended queue so pop(0) has less work to do - factor out the list of summits of these three changes, only the last one has any noticable effect on the run time. 🤷	2024-12-10 05:49:48 +00:00
magical	984d92dd6e	day 10	2024-12-10 05:42:13 +00:00

Author

SHA1

Message

Date

magical

ad6279089f

day 10 optimizations

- reduce duplicate queue entries by not appending to the queue if a
  point has a nonzero count. (if there's a count then it must have
  already been queued.)

- use the correct data structure for a double-ended queue so pop(0) has
  less work to do

- factor out the list of summits

of these three changes, only the last one has any noticable effect
on the run time. 🤷

2024-12-10 05:49:48 +00:00

magical

984d92dd6e

day 10

2024-12-10 05:42:13 +00:00

2 Commits (7cc13becde944812ea92496b5a8d6ac6bb6e4c58)