this post was submitted on 10 Dec 2023
21 points (95.7% liked)

Advent Of Code

158 readers
116 users here now

An unofficial home for the advent of code community on programming.dev!

Advent of Code is an annual Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like.

AoC 2024

Solution Threads

M T W T F S S
1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 18 20 21 22
23 24 25

Rules/Guidelines

Relevant Communities

Relevant Links

Credits

Icon base by Lorc under CC BY 3.0 with modifications to add a gradient

console.log('Hello World')

founded 1 year ago
MODERATORS
21
submitted 11 months ago* (last edited 11 months ago) by [email protected] to c/[email protected]
 

Day 10: Pipe Maze

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)
  • Code block support is not fully rolled out yet but likely will be in the middle of the event. Try to share solutions as both code blocks and using something such as https://topaz.github.io/paste/ , pastebin, or github (code blocks to future proof it for when 0.19 comes out and since code blocks currently function in some apps and some instances as well if they are running a 0.19 beta)

FAQ


🔒 Thread is locked until there's at least 100 2 star entries on the global leaderboard

🔓 Unlocked after 40 mins

you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 2 points 11 months ago (2 children)

Nim

I got a late start on part 1, and then had to sleep on part 2. Just finished everything up with a little time to spare before day 11.

Part 2 probably would have been easier if I knew more about image processing, but I managed:

  • Made a copy of the grid and filled it with . tiles
  • Copied all of the path tiles that I had calculated in part 1
  • Flood-filled all the . tiles that are connected to the outside edges of the grid with O tiles
  • Walked along the path, looking for an adjacent O tile at each step. Stopped when one was found, and recorded whether it was to the left or right of the path.
  • Walked the path again, flood-filling any adjacent inside . tiles with I, and counted them

Code:

[–] [email protected] 1 points 11 months ago* (last edited 11 months ago) (1 children)

btw if you put the url to nim as /c/[email protected] I dont think the url bot will trigger since it does the same thing the ! format does

[Nim](/c/[email protected])

Nim

Edit: yeah looks like it didnt reply to me so this format works

[–] [email protected] 1 points 11 months ago

Unfortunately then it'll be broken for kbin users. I can do it anyway though if the bot is too annoying, just lmk.

[–] [email protected] 1 points 11 months ago

Hi there! Looks like you linked to a Lemmy community using a URL instead of its name, which doesn't work well for people on different instances. Try fixing it like this: [email protected]