Advent of Code F# – Day 14

The source code for this post (both Part 1 and Part 2) is available here and you can click here to see my solutions for the other Advent of Code challenges.

Description for today’s challenge is here.

 

This challenge involves a lot of calculations with km, seconds, km/s, etc. so let’s define these units:

day14_01

Since a reindeer can be either resting, or flying, let’s capture that as its status:

day14_02

and finally, let’s capture other important info such as speed, how long a reindeer can fly/rest for, etc:

day14_03

The input to this challenge looks like this:

Rudolph can fly 22 km/s for 8 seconds, but then must rest for 165 seconds.

Cupid can fly 8 km/s for 17 seconds, but then must rest for 114 seconds.

Prancer can fly 18 km/s for 6 seconds, but then must rest for 103 seconds.

so let’s parse each line into a new State for a reindeer:

day14_04

couple of things to note from the above:

  1. Distance is initialized at 0<km>
  2. Status is initialized as Flying 0<s>, as in ‘has flown for 0 seconds’

Next, let’s simulate how the state of a reindeer transitions from one second to the next:

day14_05

this should seem pretty straightforward, the only thing worth pointing out is that when Status transitions from Resting => Flying and Flying => Resting, the new status is associated with 1<s> rather than 0<s>. That’s because in the second that has just passed (between the start of the function and the end), we have actually been in the new status.

e.g. at the start of the function, we deemed that we have already flown for the max amount of time possible, so for the duration of this second, we’ll be resting, which is why our Distance hasn’t changed and why by the end of the function, we’ll have rested for 1 second.

Finally, let’s run this simulation for 2503 seconds and find the furthest Distance of all the reindeer:

day14_06

 

Part 2

Part 2 introduces a new concept of Score, so let’s update our model:

day14_07

and at the end of each round of simulation, we’ll need to award the reindeer that has flown the furthest with a point each:

day14_08

and finally, we’re looking for the highest Score instead of the furthest Distance:

day14_09

Enjoy what you’re reading? Subscribe to my newsletter and get more content on AWS and serverless technologies delivered straight to your inbox.


Yan Cui

I’m an AWS Serverless Hero and the author of Production-Ready Serverless. I have run production workload at scale in AWS for nearly 10 years and I have been an architect or principal engineer with a variety of industries ranging from banking, e-commerce, sports streaming to mobile gaming. I currently work as an independent consultant focused on AWS and serverless.

You can contact me via Email, Twitter and LinkedIn.

Hire me.


Check out my new course, Complete Guide to AWS Step Functions.

In this course, we’ll cover everything you need to know to use AWS Step Functions service effectively. Including basic concepts, HTTP and event triggers, activities, design patterns and best practices.

Get Your Copy