this post was submitted on 12 Dec 2024
16 points (90.0% liked)

Advent Of Code

980 readers
18 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 19 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
 

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

you are viewing a single comment's thread
view the rest of the comments
[–] Quant 2 points 4 days ago (1 children)

I found multidimensional markers for partition to work really well for finding the fields: Areas ← βŠœβ–‘:⇑△.+1βœβ™­βŠ› It just groups the other array's contents according to adjacent markers, horizontally and vertically. Took me quite a bit to figure out what's actually happening in the example in the documentation ^^'

[–] [email protected] 2 points 4 days ago* (last edited 4 days ago) (1 children)

Ooh, interesting, I'll have to give that a try. Thanks!

(edit) Wow, that replaced my three lines of overly complex code without a hitch. classify is an operator I never really got the point of before. Beautiful.

Data ← βŠœβˆ˜βŠΈβ‰ @\n "AAAA\nBBCD\nBBCC\nEEEC"
Nβ‚„     ← [Β―1_0 1_0 0_Β―1 0_1]               # Four orthogonal neighbours.
Fences ← /+≑(/+=0⬚0⊑+Nβ‚„Β€)βŠ™Β€βŠš.°⊚            # Fences for a field, by looking for edges.
Cs     ← [0 1 1 0 1 0 2 1 1 2 0 1 0 1 1 0] # Number of corners keyed by bitarray of 2x2 grid.
Sides  ← /+/+⧈(⊑:CsΒ°β‹―β™­)2_2βŒβ†˜Β―1_Β―1βŒβ†˜1_1°⊚   # Add border, look for corners in 2x2 windows.

Fields ← βŠœβ–‘:⇑△.+1βœβ™­βŠ›Data

/+Γ—β‰‘β—‡βŠƒβ§»Fences Fields
/+Γ—β‰‘β—‡βŠƒβ§»Sides Fields
[–] Quant 2 points 4 days ago (1 children)
[–] [email protected] 2 points 4 days ago* (last edited 4 days ago) (1 children)

1.8s now. 99% of that in Sides. I've just had an idea though... ~~maybe too late for today though!~~

edit: prepending β‰‘βš(-€⊸/↧) toFields spared me from manipulating hundreds of irrelevant 0's, so time is very good now at 55ms.

[–] Quant 2 points 2 days ago (1 children)

Damn that's a lot time saved. I love how unassuming the addition looks for how great an effect it has

[–] [email protected] 1 points 2 days ago

It was a real D'oh! moment when I visualised the data I was generating and saw all the zeros stretching across the page.