DEV Community

10x learner
10x learner

Posted on • Originally published at on

Advent Of Code – Perfectly Spherical Houses in a Vacuum – Puzzle 3

Hello ! I’m Xavier Jouvenot and here is the third part of a long series on Advent Of Code. You can find the previous part here

For this new post, we are going to solve the second problem from the 3rd December 2015, named "Perfectly Spherical Houses in a Vacuum". The solution I will propose in C++, but the reasoning can be applied to other languages.

Part 1

The Problem

The full version of this problem can be found directly on the Advent of Code website, I will only describe the essence of the problem here:

Santa is delivering presents to an infinite two-dimensional grid of houses. He starts by delivering a present to the house at his starting location, and then an elf at the North Pole tells him, via radio where to move next. He moves one house at the time either to the north (^), south (v), east (>), or west (<). Each time, Santa visits a house, he delivers one present, but, the elf giving the instructions to Santa drank too much eggnog, and made Santa visiting houses more than once. So, we have to found out how many houses receive at least one present.

For example:

  • >> makes Santa deliver one present to 3 houses, the one in which he starts and the 2 houses to the east from there.
  • ^v^v^v^v^v makes Santa deliver a bunch of presents to 2 houses.


Here I will describe the thought process I’ve used to arrive to the solution.

First, we have to know the location of Santa on the grid of houses, which means we need his Coordinate.

struct Coordinate
    int x{0};
    int y{0};

Coordinate santaPosition;
Enter fullscreen mode Exit fullscreen mode

Now that we have Santa’s location, we have to store the path that Santa goes on. The simplest way to describe this path is a list of Coordinates.

#include <vector>

using Path = std::vector<Coordinate>
Path santaPath;
Enter fullscreen mode Exit fullscreen mode

We have finally every structures to handle the problem. Now, we have to get the path taken by Santa.

// Adds the house where Santa start to deliver presets

for(auto direction : input)
    // Modify Santa's location
    switch (direction)
        case '^': ++santaPosition.y; break;
        case '>': ++santaPosition.x; break;
        case '<': --santaPosition.x; break;
        case 'v': --santaPosition.y; break;
    // Adds the new location to Santa's path
Enter fullscreen mode Exit fullscreen mode

Finally, we have the path taken by Santa.7 All we need to do now, is to found out the number different houses there is on Santa’s path. For that, we are going to use 2 std algorithms : std::sort and std::unique.

#include <algorithm>

std::sort(std::begin(santaPath), std::end(santaPath));
auto it = std::unique(std::begin(santaPath), std::end(santaPath));
const auto numberOfHousesVisited = std::distance(std::begin(santaPath), it);
Enter fullscreen mode Exit fullscreen mode

Note that, to be able to use those algorithms, we have to specify the operators == and < of the structure Coordinate.

I encourage you to go look at the full solution used in this sample of code on my GitHub.

Part 2


This problem is the same as the part one, except that now, there are two "delivery men", Santa and Robo-Santa. Both start at the same position and take turns moving based on instructions from the elf. We still have to found out how many houses receive at least one present.

For example:

  • ^v delivers presents to 3 houses, because Santa goes north, and then Robo-Santa goes south.


Most of the source code is very similar to the part 1, so we will only focus on the differences. To start, we can integrate a common structure to Santa and Robo-Santa, that I called DeliveryMan.

struct DeliveryMan
    Coordinate position;
    Path path;

DeliveryMan santa, roboSanta;
Enter fullscreen mode Exit fullscreen mode

When collecting the instruction, we can switch between the delivery man receiving the instruction with a ternary instruction.

DeliveryMan deliveryMan;

deliveryMan = deliveryMan == &santa ? &roboSanta: &santa;
Enter fullscreen mode Exit fullscreen mode

And finally, once we’ve sorted both Santa and Robo-Santa paths, we have to merge them before using std::unique.

std::vector<Coordinate> mergedPath;
    std::merge(std::begin(santa.path), std::end(santa.path), std::begin(roboSanta.path), std::end(roboSanta.path), std::back_inserter(mergedPath));
Enter fullscreen mode Exit fullscreen mode

And that’s it about the interesting point of this part. You can check the full solution of this code on my GitHub.


You can note that the solutions written in this post, don’t include all the sources to make running programs, but only the interesting part of the sources to solve this problem. If you want to see the programs from end to end, you can go on my [GitHub account], explore the full solution, add comments or ask questions if you want to.

Here is the list of std methods and containers that we have used, I can’t encourage you enough to look at their definitions :

Thanks for you reading, hope you liked it 😃

And until next part, have fun learning and growing.

Top comments (0)