🌻 - 2024 DAY 12 SOLUTIONS -🌻
🌻 - 2024 DAY 12 SOLUTIONS -🌻
Day 12: Garden Groups
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
You're viewing a single thread.
26 comments
Uiua
I spent a while thinking about how to best do a flood fill in Uiua when I saw that
⊜(partition) works beautifully with multidimensional markers: "Groups are formed from markers that are adjacent along any axis.", meaning I just had to convert all letters into numbers and I'd get all indices belonging to a field into an array.
For part 2, I cheated a bit by coming here and reading that you only need to count the edges. To my surprise, the second part is actually a bit faster than part 1. Takes less than 0.2 seconds each though :DRun with example input here
$ RRRRIICCFF $ RRRRIICCCF $ VVRRRCCFFF $ VVRCCCJFFF $ VVVVCJJCFE $ VVIVCCJJEE $ VVIIICJJEE $ MIIIIIJJEE $ MIIISIJEEE $ MMMISSJEEE . N ← +[0_¯1 0_1 ¯1_0 1_0] Areas ← ⊜□:⇡△.+1⍜♭⊛ Peri ← -/+≡(/+∊N¤)⟜¤⟜(×4⧻) Sides ← ( ⊙(-¤)↯:▽⊙0×°⊟.+2⌵⊸-+1⊃⊣⊢⊸⍜⍉≡⍆ ⧻⊚⊸∊1_3⧈(/+/+)2_2.⍜⊡=₀+1: +⊙(×2/+/+⧈(∊[[1_0 0_1][0_1 1_0]])2_2◌) ) Cost! ← /+≡◇(×^0⟜⧻) PartOne ← ( # &rs ∞ &fo "input-12.txt" ⊜∘≠@\n. Cost!Peri Areas ) PartTwo ← ( # &rs ∞ &fo "input-12.txt" ⊜∘≠@\n. Cost!Sides Areas ) &p "Day 12:" &pf "Part 1: " &p PartOne &pf "Part 2: " &p PartTwo
26 comments