Day 18: Ram Run
Megathread guidelines
- Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
- You can send code in code blocks by using three backticks, the code, and then three backticks or use something such as https://topaz.github.io/paste/ if you prefer sending it through a URL
FAQ
- What is this?: Here is a post with a large amount of details: https://programming.dev/post/6637268
- Where do I participate?: https://adventofcode.com/
- Is there a leaderboard for the community?: We have a programming.dev leaderboard with the info on how to join in this post: https://programming.dev/post/6631465
That would be cool af to see in C, let me know if you do. In python, we can built the two sets, and have the convenient function call of set( [iterate-able object/list/set] ).intersection( [iterate-able object/list/set] ) to see if the two sets touches/intersects as the block that connects the two sets would be in both sets/lists.
The way I would build the two sets would be to start at the final state with all blocks placed and just union-find all the blocks. When we find that a block appears in both sets, then we stop the union and proceed with the other unions until we find all the blocks that would appear in both sets. then we iteratively find the first block that would appear in both sets. In python the intersection call returns a set, so you can stack the intersect call. like so: set( [top right union set] ).intersection( [bottom left union set] ).intersection( [ one item list with the current block we are checking ] ) technically you can just save the intersections of the first two sets to save a little time because they would not change.
I didn’t think of this until recently, but I also think it is such a simple and elegant solution. Live and learn! 😄
hope you are having a good holiday season!
