advent of code 2025 | libVencore | Page 7

cloud iron Dec 8, 2025, 1:35 AM

#

ok so d7p1 is easy

#

but what the fuck is that p2

lusty atlas Dec 8, 2025, 1:44 AM

#

u got this

cloud iron Dec 8, 2025, 1:46 AM

#

yeah i know

#

it's just classic exploration

#

and we can do breadth first or depth first, doesn't even matter

#

annoying algo to write tho

frigid socket Dec 8, 2025, 1:47 AM

#

oh wait @lusty atlas i got an IDEA

#

||as soon as i reach the final splitter i blacklist its left side and when i reiterate it it’s forced to use the right side and then blacklist the left side of the parent splitter and all||

cloud iron Dec 8, 2025, 1:50 AM

#

did you guys wrote breadth first or depth first ?

#

i want to innovate

frigid socket Dec 8, 2025, 1:51 AM

#

what is breadth

#

bread th

cloud iron Dec 8, 2025, 1:53 AM

#

when you check line per line

#

looking not at the depth but at the width

lusty atlas Dec 8, 2025, 1:54 AM

#

frigid socket ||as soon as i reach the final splitter i blacklist its left side and when i rei...

overcomplicating

cloud iron Dec 8, 2025, 1:54 AM

#

frigid socket what is breadth

https://wikipedia.org/wiki/Breadth-first_search

Breadth-first search

Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores all nodes at the present depth prior to moving on to the nodes at the next depth level. Extra memory, usually a queue, is needed to keep track of the child nodes that were encountered ...

pale stirrup Dec 8, 2025, 1:55 AM

#

new output

cloud iron Dec 8, 2025, 2:03 AM

#

actually if i do DFS and don't want time to explode i have to like memoize and shit

#

and do recursive stuff

#

and i hate that

#

so time for dynamic BFS programming

pale stirrup Dec 8, 2025, 2:07 AM

#

pale stirrup new output

@robust yacht you love

robust yacht Dec 8, 2025, 2:11 AM

#

yop

pale stirrup Dec 8, 2025, 2:12 AM

#

you also love my shell prompt

robust yacht Dec 8, 2025, 2:12 AM

#

maybe

pale stirrup Dec 8, 2025, 2:13 AM

#

looks worse there bc no ide has a good looking terminal

lusty atlas Dec 8, 2025, 2:13 AM

#

pale stirrup new output

vibecoded

pale stirrup Dec 8, 2025, 2:16 AM

#

nopp

#

i made most of that last year

#

i just added stuff for expected results

cloud iron Dec 8, 2025, 2:19 AM

#

alr the BFS wasn't as bad as i tought

📎 07.js

#

did someone do DFS with the whole recursive and memoization stuff ?

pale stirrup Dec 8, 2025, 2:22 AM

#

i think thats technically what i did

#

||https://github.com/wingio/advent-of-code/blob/2025/aoc%2Fsolver%2Fsrc%2FcommonMain%2Fkotlin%2Fsolver%2Fsolutions%2FDay07.kt#L16-L28||

cloud girderBOT Dec 8, 2025, 2:22 AM

#

pale stirrup ||https://github.com/wingio/advent-of-code/blob/2025/aoc%2Fsolver%2Fsrc%2Fcommon...

aoc/solver/src/commonMain/kotlin/solver/solutions/Day07.kt: Lines 16-28
||```kt
part2(expected = 40941112789504) {
val manifold = Grid.charGrid(input)
val cache = mutableMapOf<Point, Long>()

fun search(point: Point): Long = cache.getOrPut(point) {
    when(manifold.getOrNull(point.down)) {
        '^' -> search(point.left) + search(point.right)
        '.' -> search(point.down)
        else -> 1
    }
}
search(manifold.pointOfFirst { it == 'S' })

}

cloud iron Dec 8, 2025, 2:23 AM

#

i'm pretty sure that BFS is faster than DFS cause BFS is O(row*col) and DFS is O(solution) (at max but can go lower thanks to memoization)

cloud iron Dec 8, 2025, 2:24 AM

#

cloud girder **aoc/solver/src/commonMain/kotlin/solver/solutions/Day07.kt:** Lines 16-28 ||``...

that's BFS

#

isn't it ?

#

yeah it is

pale stirrup Dec 8, 2025, 2:24 AM

#

idk maybe

cloud iron Dec 8, 2025, 2:25 AM

#

i mean no actually

pale stirrup Dec 8, 2025, 2:25 AM

#

i didn't map out how it searched

cloud iron Dec 8, 2025, 2:25 AM

#

you're doing DFS

#

recursion makes me always confused

#

iteration is a fancy form of recursion

frigid socket Dec 8, 2025, 2:25 AM

#

might ask ai for d7p2

cloud iron Dec 8, 2025, 2:25 AM

#

frigid socket might ask ai for d7p2

what

#

no

pale stirrup Dec 8, 2025, 2:25 AM

#

don't

cloud iron Dec 8, 2025, 2:26 AM

#

don't give up

frigid socket Dec 8, 2025, 2:26 AM

#

jkjk i dont use AI you know you know

cloud iron Dec 8, 2025, 2:26 AM

#

you have 2 both valid choices

pale stirrup Dec 8, 2025, 2:26 AM

#

look at our solutions before if you're really that stuck

frigid socket Dec 8, 2025, 2:26 AM

#

i have a plan

cloud iron Dec 8, 2025, 2:26 AM

#

BFS like me and dynamic programming
or DFS like wingd with recursion and memoization

feral valve Dec 8, 2025, 2:27 AM

#

cloud iron did someone do DFS with the whole recursive and memoization stuff ?

ye

pale stirrup Dec 8, 2025, 2:27 AM

#

both are actually fast if you aren't stupid

feral valve Dec 8, 2025, 2:28 AM

#

this is dfs

cloud iron Dec 8, 2025, 2:28 AM

#

mmmm

#

doesn't seem that bad

#

i hate recursion

#

but to be trained, i'll do it

feral valve Dec 8, 2025, 2:28 AM

#

recursion is super clean here

lusty atlas Dec 8, 2025, 2:29 AM

#

i used DFS

cloud iron Dec 8, 2025, 2:29 AM

#

yeah but look at my BFS

#

it's so nice

lusty atlas Dec 8, 2025, 2:29 AM

#

with recursion too

cloud iron Dec 8, 2025, 2:29 AM

#

dynamic programming so cool

#

also i think faster

pale stirrup Dec 8, 2025, 2:29 AM

#

that seems to just be the easier solution

cloud iron Dec 8, 2025, 2:29 AM

#

it's why i'll code both actually

#

i wanna see which is better

lusty atlas Dec 8, 2025, 2:30 AM

#

feral valve this is dfs

ruby

#

have u tried crystal

pale stirrup Dec 8, 2025, 2:30 AM

#

yeah I've done meth

lusty atlas Dec 8, 2025, 2:30 AM

#

cloud iron yeah but look at my BFS

i mean my DFS is very clean imo https://github.com/Vendicated/AdventOfCode/blob/main/2025/day7/solution.cr

feral valve Dec 8, 2025, 2:31 AM

#

lusty atlas have u tried crystal

nope

lusty atlas Dec 8, 2025, 2:31 AM

#

try it!!

#

crystal is just compiled + typed ruby

feral valve Dec 8, 2025, 2:31 AM

#

i think i’ve heard you praise it previously

lusty atlas Dec 8, 2025, 2:32 AM

#

love

#

ruby is so fucking slow

feral valve Dec 8, 2025, 2:33 AM

#

oh wow crystal has macros

#

that’s pretty cool

lusty atlas Dec 8, 2025, 2:34 AM

#

yesss

feral valve Dec 8, 2025, 2:36 AM

#

mmm crystal looks pretty good

#

i like the typing at a glance as well

lusty atlas Dec 8, 2025, 2:36 AM

#

the typing is very out of your way and mostly inferred, you hardly ever have to specify types

#

only when creating empty hash, array etc

feral valve Dec 8, 2025, 2:38 AM

#

def add(a, b)
a + b
end

add 1, 2 # => 3
add "foo", "bar" # => "foobar"

i liked this example

#

i can’t think of what it’d actually be used for though, other than stuff like print

cloud iron Dec 8, 2025, 2:39 AM

#

alr done both BFS and DFS now

📎 07.js

#

note don't try to use a tuple as a key for a map in javascript

lusty atlas Dec 8, 2025, 2:39 AM

#

biggest dsa nerd

cloud iron Dec 8, 2025, 2:39 AM

#

it doesn't go well

lusty atlas Dec 8, 2025, 2:40 AM

#

cloud iron note don't try to use a tuple as a key for a map in javascript

yeah lmao

#

just stringify it or smth xD

#

x_y

feral valve Dec 8, 2025, 2:40 AM

#

hmm crystals pattern matching looks lackluster

cloud iron Dec 8, 2025, 2:41 AM

#

yeah so there's kinda no contest here
i didn't forget to do warmup iterations btw

cloud iron Dec 8, 2025, 2:41 AM

#

lusty atlas just stringify it or smth xD

yeah i did, x,y

lusty atlas Dec 8, 2025, 2:42 AM

#

feral valve hmm crystals pattern matching looks lackluster

is it better in ruby?

feral valve Dec 8, 2025, 2:42 AM

#

i don’t know ruby

#

but i doubt it matches rust or ocaml, of which i really enjoy using

lusty atlas Dec 8, 2025, 2:44 AM

#

make ur own pattern matching macro

cloud iron Dec 8, 2025, 3:15 AM

#

ok so actually my BFS was only slower cause of my key being a string, but they are actually the same

📎 07.js

cloud iron Dec 8, 2025, 3:16 AM

#

lusty atlas biggest dsa nerd

also actually i didn't read that, but thanks
proud to be

cloud iron Dec 8, 2025, 3:20 AM

#

cloud iron ok so actually my BFS was only slower cause of my key being a string, but they a...

oops forgor spoiler

terse edge Dec 8, 2025, 4:25 AM

#

have u not seen my code???

#

https://codeberg.org/eagely/adventofcode-kotlin/src/commit/723182e8d9f62e61723b4d3d20f5fd8cae004a0a/src/main/kotlin/solutions/y2025/Day7.kt

pale stirrup Dec 8, 2025, 4:28 AM

#

what does dp stand for

robust yacht Dec 8, 2025, 4:57 AM

#

pale stirrup what does dp stand for

die wing die

#

DISTANCE

#

i already hate this

#

ok i literally do not undersatnd this what the fuck

dusky frost Dec 8, 2025, 5:16 AM

#

pale stirrup what does dp stand for

Dynamic programming

terse edge Dec 8, 2025, 5:27 AM

#

@native maple n part 1 what happens if i get boxes a and b where a is already present in one circuit and b is present in another?
do i merge the circuits?

#

oh ur asleep

pale stirrup Dec 8, 2025, 5:28 AM

#

i can successfully get the distance between any two coordinates (||using euclidean||) just don't know how to sort them

#

do i need to get every possible pair?

robust yacht Dec 8, 2025, 5:29 AM

#

||i dont think sort is necessary. i think you have to find the closest junctions on each iteration||

pale stirrup Dec 8, 2025, 5:29 AM

#

||so just iterate through the list and find the closest to each item?||

robust yacht Dec 8, 2025, 5:29 AM

#

||thats what im trying||

#

im able to get the first closest pair

#

wait

#

im close

#

nvm

fallen lily Dec 8, 2025, 5:49 AM

#

pale stirrup what does dp stand for

Display port

robust yacht Dec 8, 2025, 5:55 AM

#

@pale stirrup have you figured ito ut

pale stirrup Dec 8, 2025, 5:57 AM

#

i feel like im close

robust yacht Dec 8, 2025, 5:59 AM

#

io cant figure out the condition i need to skip

verbal parrot Dec 8, 2025, 6:04 AM

#

has nun of u done it yet is it that hard

#

i haven’t rly read the problem i just read “x, y, z” and closed the tab

robust yacht Dec 8, 2025, 6:06 AM

#

my ide is compeltly broken wtf

#

never had this happen

robust yacht Dec 8, 2025, 6:27 AM

#

@pale stirrup idk what to do help

verbal parrot Dec 8, 2025, 6:30 AM

#

are u supposed to like find the shortest pair of boxes every iteration?

#

how do u do it efficently

robust yacht Dec 8, 2025, 6:32 AM

#

ok apparently there's a data structure that works for this: ||disjoint set union||

terse edge Dec 8, 2025, 6:36 AM

#

@native maple

#

stupid Day

#

like

#

the problem isnt described in the puzzle description

robust yacht Dec 8, 2025, 6:37 AM

#

yop

#

bad

terse edge Dec 8, 2025, 6:39 AM

#

@native maple and whoever else didnt do it yet, im not spoilering it because its not described in the puzzle description but an integral part of what youre supposed to do

see c and d, connect them
see a and c, add to [c, d]
see b and d, add to [c, d, a]
see a and b, do nothing, still increment the counter
see a and b, do nothing, dont increment the counter

pale stirrup Dec 8, 2025, 6:40 AM

#

what counter

#

is that p2

robust yacht Dec 8, 2025, 6:41 AM

#

@pale stirrup hi

pale stirrup Dec 8, 2025, 6:41 AM

#

im very confused

robust yacht Dec 8, 2025, 6:45 AM

#

guh i dont know how to apply ||DSU|| to this

#

i hate mathematical problems

#

wtf some of hte solutions are so much simpler

pale stirrup Dec 8, 2025, 6:51 AM

#

my solution so far generated circuits with 3 items

robust yacht Dec 8, 2025, 6:52 AM

#

are you still doing it

pale stirrup Dec 8, 2025, 6:52 AM

#

probably gonna save it for later

#

its 2am and i don't think I've made much progress

robust yacht Dec 8, 2025, 6:53 AM

#

me too

pale stirrup Dec 8, 2025, 6:53 AM

#

@terse edge can you send me all the circuits for the example input so that i can debug my solution

terse edge Dec 8, 2025, 6:53 AM

#

pale stirrup <@415132870252822539> can you send me all the circuits for the example input so ...

16.902: [162, 817, 812] - [425, 690, 689]
321.560: [162, 817, 812] - [431, 825, 988]
322.369: [906, 360, 560] - [805, 96, 715]
328.119: [431, 825, 988] - [425, 690, 689]
333.656: [862, 61, 35] - [984, 92, 344]
338.339: [52, 470, 668] - [117, 168, 530]
344.389: [819, 987, 18] - [941, 993, 340]
347.599: [906, 360, 560] - [739, 650, 466]
350.786: [346, 949, 466] - [425, 690, 689]
352.936: [906, 360, 560] - [984, 92, 344]

robust yacht Dec 8, 2025, 6:53 AM

#

whar

#

thats just distances?

fallen lily Dec 8, 2025, 6:59 AM

#

Guh how bad is d8

terse edge Dec 8, 2025, 6:59 AM

#

robust yacht thats just distances?

this is all the connections you have to make

#

note how 431 y z and 425 y z appear twice each

pale stirrup Dec 8, 2025, 7:01 AM

#

top is supposed to be 316 right

#

i think you cut off the 3

terse edge Dec 8, 2025, 7:02 AM

#

ye

native maple Dec 8, 2025, 7:03 AM

#

just woke up

#

i'll do it in the car

robust yacht Dec 8, 2025, 7:03 AM

#

@native maple hii

#

i spent 2h ours and havent made any progress

#

roie will solve in < 10 minutes

native maple Dec 8, 2025, 7:04 AM

#

is this the prophesized ramp up in difficulty

terse edge Dec 8, 2025, 7:04 AM

#

native maple i'll do it in the car

rosie

#

the description is retarded

#

its not that hard

#

its just hard to understand

#

if you guess right at the start yuo win

pale stirrup Dec 8, 2025, 7:05 AM

#

i have this so im definitely doing something wrong

terse edge Dec 8, 2025, 7:05 AM

#

we had ppl do it in 3 mins and i have this

robust yacht Dec 8, 2025, 7:05 AM

#

pale stirrup i have this so im definitely doing something wrong

interesting

terse edge Dec 8, 2025, 7:05 AM

#

@native maple

terse edge Dec 8, 2025, 7:05 AM

#

terse edge <@581573474296791211> and whoever else didnt do it yet, im not spoilering it bec...

@pale stirrup

robust yacht Dec 8, 2025, 7:06 AM

#

@pale stirrup sleep

#

you can't get it before me

terse edge Dec 8, 2025, 7:06 AM

#

@robust yacht

robust yacht Dec 8, 2025, 7:06 AM

#

@terse edge

terse edge Dec 8, 2025, 7:06 AM

#

@robust yacht @pale stirrup @native maple doing nothing counts as connecting two cables if you havent seen that exact pair of cables before (even if theyve appeared before and you added them to circuits)

pale stirrup Dec 8, 2025, 7:06 AM

#

terse edge <@298295889720770563>

i do that separately in a second step

terse edge Dec 8, 2025, 7:07 AM

#

pale stirrup i do that separately in a second step

make it so it prints that

#

then compare

robust yacht Dec 8, 2025, 7:07 AM

#

what would I even store my connections as

terse edge Dec 8, 2025, 7:07 AM

#

why do you have more than 10 connections

terse edge Dec 8, 2025, 7:07 AM

#

robust yacht what would I even store my connections as

irrelevant

robust yacht Dec 8, 2025, 7:07 AM

#

HashMap<Vec3, List<Vev3>>

#

how

pale stirrup Dec 8, 2025, 7:07 AM

#

my second step generates a list of circuits

terse edge Dec 8, 2025, 7:07 AM

#

i store a MutableList<HashSet<Point3D>>

robust yacht Dec 8, 2025, 7:08 AM

#

I'm stuck with knowing what points to skip

pale stirrup Dec 8, 2025, 7:09 AM

#

yeah im gonna pause for now

native maple Dec 8, 2025, 7:09 AM

#

terse edge <@289556910426816513> <@298295889720770563> <@581573474296791211> doing nothing ...

i haven't read the problem yet so atm you just sound schizo

#

hold on lol

robust yacht Dec 8, 2025, 7:10 AM

#

pale stirrup yeah im gonna pause for now

don't wake up until after 12

terse edge Dec 8, 2025, 7:10 AM

#

pale stirrup yeah im gonna pause for now

in exampe youre supposed to make 8 or 9 connections

#

not 10

#

even tho it says 10

robust yacht Dec 8, 2025, 7:10 AM

#

oh

terse edge Dec 8, 2025, 7:10 AM

#

ur supposed to count doing nothing as making connections

robust yacht Dec 8, 2025, 7:10 AM

#

guh

#

then my logic won't even work

terse edge Dec 8, 2025, 7:11 AM

#

nothing happens BESIDES your counter getting incremented

robust yacht Dec 8, 2025, 7:11 AM

#

I make connections then calculate seperate

robust yacht Dec 8, 2025, 7:11 AM

#

terse edge nothing happens BESIDES your counter getting incremented

this is what I'm stuck on

#

how do you determine when to skip

pale stirrup Dec 8, 2025, 7:12 AM

#

if both a and b are already in any other circuits, i skip?

robust yacht Dec 8, 2025, 7:12 AM

#

if I do skip when ciruits.any { a in it || b in it} I get stuck in loop

#

it keeps finding the same closest points

#

eagely teach me your wisdom

terse edge Dec 8, 2025, 7:15 AM

#

pale stirrup if both a and b are already in any other circuits, i skip?

you merge the circuits

terse edge Dec 8, 2025, 7:16 AM

#

robust yacht if I do skip when `ciruits.any { a in it || b in it}` I get stuck in loop

if a and b are in different circuits, they become the same circuit

#

because yuo connected a and b

pale stirrup Dec 8, 2025, 7:16 AM

#

hm

#

definitely something to sleep on

robust yacht Dec 8, 2025, 7:17 AM

#

terse edge if a and b are in different circuits, they become the same circuit

that's what I'm missing yea

#

I was getting like 20 circuits

#

with the example

terse edge Dec 8, 2025, 7:17 AM

#

you cant use hashset<circuit>, if you remove circuit to merge it hashset wont remove it sometimes idk why

#

use mutablelist<circuit>

#

i wasted an hour on that

pale stirrup Dec 8, 2025, 7:18 AM

#

my issue is im getting too few circuits

#

only 6

robust yacht Dec 8, 2025, 7:18 AM

#

oh yea

#

I got 6 too

terse edge Dec 8, 2025, 7:19 AM

#

print the circuits at the end

pale stirrup Dec 8, 2025, 7:20 AM

#

i do

terse edge Dec 8, 2025, 7:20 AM

#

give me

#

the output

pale stirrup Dec 8, 2025, 7:20 AM

#

terse edge Dec 8, 2025, 7:21 AM

#

pale stirrup

are you running 11 times maybe

pale stirrup Dec 8, 2025, 7:22 AM

#

im not running a fixed amount of times

terse edge Dec 8, 2025, 7:22 AM

#

(40, [862-61-35, 739-650-466, 984-92-344, 805-96-715, 906-360-560]
[346-949-466, 431-825-988, 425-690-689, 162-817-812]
[117-168-530, 52-470-668]
[941-993-340, 819-987-18]
[57-618-57]
[592-479-940]
[352-342-300]
[466-668-158]
[542-29-236]
[216-146-977]
[970-615-88])

terse edge Dec 8, 2025, 7:22 AM

#

pale stirrup im not running a fixed amount of times

huh

#

yuore supposed to run 10 times

robust yacht Dec 8, 2025, 7:22 AM

#

mine just has a queue and finds the next closest circuit on each iteration

robust yacht Dec 8, 2025, 7:22 AM

#

terse edge yuore supposed to run 10 times

where does it say that

terse edge Dec 8, 2025, 7:23 AM

#

for sample 10 times

#

for real input 1000

#

first line of each paragraph

robust yacht Dec 8, 2025, 7:23 AM

#

guh

#

could've been more obvious

terse edge Dec 8, 2025, 7:26 AM

#

@native maple @pale stirrup @robust yacht https://codeberg.org/eagely/adventofcode-kotlin/src/branch/main/src/main/kotlin/solutions/y2025/Day8.kt

robust yacht Dec 8, 2025, 7:28 AM

#

guhhh so short

#

my p1 alone is already nearly 50 lines

terse edge Dec 8, 2025, 7:45 AM

#

robust yacht my p1 alone is already nearly 50 lines

u can just ||make list of 1000 sets of size 1 each with a point, iterate over lines sorted by distances take first 1000 and merge||

hoary mirage Dec 8, 2025, 7:46 AM

#

NOT A BUG

robust yacht Dec 8, 2025, 7:49 AM

#

terse edge u can just ||make list of 1000 sets of size 1 each with a point, iterate over li...

I'll try later

#

gn

native maple Dec 8, 2025, 7:51 AM

#

ok well i did it

#

but i don't like my solution much

terse edge Dec 8, 2025, 7:52 AM

#

native maple ok well i did it

did u account for doing nothing still counting immediately

#

@native maple i prefer 6am over 10am

#

2nd day in a row that someone wanted to do smth at 10am

#

yday my aunt came over while i was doing aoc

#

today i was gonna go to the barber at 10 if it wasnt for aoc

brazen salmon Dec 8, 2025, 9:11 AM

#

@frigid socket

frigid socket Dec 8, 2025, 9:24 AM

#

fake samara

#

i'll try doing AI of Code d7p2

frigid socket Dec 8, 2025, 9:53 AM

#

@native maple i found issue with my 7p2

#

no AI needed to fix

#

That's the right answer! You are one gold star closer to decorating the North Pole.

You have completed Day 7! You can [Share] this victory or [Return to Your Advent Calendar].

#

@pale stirrup is my only way out of d8 to bruteforce

#

might be tbh

pale stirrup Dec 8, 2025, 10:09 AM

#

idk i haven't solved yet

frigid socket Dec 8, 2025, 10:13 AM

#

i would do typescript (not types the language) but i have a no JS/TS rule

verbal parrot Dec 8, 2025, 11:08 AM

#

why does go not have tuples

frigid socket Dec 8, 2025, 11:09 AM

#

verbal parrot why does go not have tuples

array

#

@lusty atlas is there good crystal lsp

native maple Dec 8, 2025, 11:21 AM

#

WHY IS MY SOLUTION SO SLOW

#

takes 1.5s

verbal parrot Dec 8, 2025, 11:24 AM

#

go so hard

#

legit as hard as c++

frigid socket Dec 8, 2025, 11:25 AM

#

ig ill have to do without lsp

verbal parrot Dec 8, 2025, 11:27 AM

#

who thought it was a good idea to make slice.append(el) a global function append(slice, el)

frigid socket Dec 8, 2025, 11:28 AM

#

me

verbal parrot Dec 8, 2025, 11:29 AM

#

thats why rust is better 😅

frigid socket Dec 8, 2025, 11:29 AM

#

might ban @verbal parrot soon ykyk

#

at least you have a lsp @verbal parrot

#

and i do not

verbal parrot Dec 8, 2025, 11:31 AM

#

it kinda works
faint@faints-MacBook-Pro 08 % go run 08.go
[{{162 817 812} {425 690 689}} {{162 817 812} {431 825 988}}

#

i got the first shortest paths correctly

#

if only i didnt start solving it six hours after it started

verbal parrot Dec 8, 2025, 11:32 AM

#

frigid socket at least you have a lsp <@481532274211422209>

no lsp is fine

#

i didnt have one when i was doing it in elixir

#

cuz the lsp expected me to have an elixir project and i was just doing it single file

frigid socket Dec 8, 2025, 11:32 AM

#

yeah same for crystal

#

i think

#

vee will know more

#

im so good @verbal parrot

verbal parrot Dec 8, 2025, 11:41 AM

#

do d8

frigid socket Dec 8, 2025, 11:41 AM

#

im doing

#

d8 seems cancer

#

@verbal parrot i can now list tuples

#

revolutionary

verbal parrot Dec 8, 2025, 11:52 AM

#

ykyk just fmt.Println(slice) ykyk

#

@terse edge what is the example supposed to output?

#

this so dumb like why do they only show output for first 10 shortest ones

#

if the example is fucking 20 boxes

#

holy fuck my shit so fast

Benchmark 1: go run 08.go
  Time (mean ± σ):     15.441 s ±  7.807 s    [User: 15.152 s, System: 0.168 s]
  Range (min … max):    0.294 s … 19.522 s    10 runs```

#

@frigid socket holy sh*t man it works with the example

40```

#

but it doesnt with the actual input 😭 iPray

frigid socket Dec 8, 2025, 12:07 PM

#

that's my life

#

d1p2 does that

verbal parrot Dec 8, 2025, 12:08 PM

#

guh idek what cud be wrong

frigid socket Dec 8, 2025, 12:10 PM

#

@verbal parrot

#

fainting my faint

verbal parrot Dec 8, 2025, 12:10 PM

#

👍👍👍👍👍👍👍👍👍👍

#

oh wait im dumb it says i need to combine 1000 pairs

#

pairs

native maple Dec 8, 2025, 12:14 PM

#

@terse edge how long does yours take

frigid socket Dec 8, 2025, 12:16 PM

#

verbal parrot oh wait im dumb it says i need to combine 1000 pairs

and what does that mean

#

i have 1000 boxes

verbal parrot Dec 8, 2025, 12:17 PM

#

1000 boxes ≠ 1000 pairs

hoary mirage Dec 8, 2025, 12:17 PM

#

@native maple what is day 8

#

explain

frigid socket Dec 8, 2025, 12:17 PM

#

verbal parrot 1000 boxes ≠ 1000 pairs

explain

#

you cannot make 1000 pairs from 1000 boxes

verbal parrot Dec 8, 2025, 12:17 PM

#

yes you can?

hoary mirage Dec 8, 2025, 12:17 PM

#

vai Equipped with a new understanding of teleporter maintenance, you confidently step onto the repaired teleporter pad.

You rematerialize on an unfamiliar teleporter pad and find yourself in a vast underground space which contains a giant playground!

Across the playground, a group of Elves are working on setting up an ambitious Christmas decoration project. Through careful rigging, they have suspended a large number of small electrical junction boxes.

Their plan is to connect the junction boxes with long strings of lights. Most of the junction boxes don't provide electricity; however, when two junction boxes are connected by a string of lights, electricity can pass between those two junction boxes.

The Elves are trying to figure out which junction boxes to connect so that electricity can reach every junction box. They even have a list of all of the junction boxes' positions in 3D space (your puzzle input).

For example:

162,817,812
57,618,57
906,360,560
592,479,940
352,342,300
466,668,158
542,29,236
431,825,988
739,650,466
52,470,668
216,146,977
819,987,18
117,168,530
805,96,715
346,949,466
970,615,88
941,993,340
862,61,35
984,92,344
425,690,689
This list describes the position of 20 junction boxes, one per line. Each position is given as X,Y,Z coordinates. So, the first junction box in the list is at X=162, Y=817, Z=812.

To save on string lights, the Elves would like to focus on connecting pairs of junction boxes that are as close together as possible according to straight-line distance. In this example, the two junction boxes which are closest together are 162,817,812 and 425,690,689.

By connecting these two junction boxes together, because electricity can flow between them, they become part of the same circuit. After connecting them, there is a single circuit which contains two junction boxes, and the remaining 18 junction boxes remain in their own individual circuits.

Now, the two junction boxes which are closest together but aren't already directly connected are 162,817,812 and 431,825,988. After connecting them, since 162,817,812 is already connected to another junction box, there is now a single circuit which contains three junction boxes and an additional 17 circuits which contain one junction box each.

The next two junction boxes to connect are 906,360,560 and 805,96,715. After connecting them, there is a circuit containing 3 junction boxes, a circuit containing 2 junction boxes, and 15 circuits which contain one junction box each.

The next two junction boxes are 431,825,988 and 425,690,689. Because these two junction boxes were already in the same circuit, nothing happens!

This process continues for a while, and the Elves are concerned that they don't have enough extension cables for all these circuits. They would like to know how big the circuits will be.

After making the ten shortest connections, there are 11 circuits: one circuit which contains 5 junction boxes, one circuit which contains 4 junction boxes, two circuits which contain 2 junction boxes each, and seven circuits which each contain a single junction box. Multiplying together the sizes of the three largest circuits (5, 4, and one of the circuits of size 2) produces 40.

Your list contains many junction boxes; connect together the 1000 pairs of junction boxes which are closest together. Afterward, what do you get if you multiply together the sizes of the three largest circuits?

explain shortly cant bother to read

frigid socket Dec 8, 2025, 12:17 PM

#

hoary mirage vai Equipped with a new understanding of teleporter maintenance, you confidently...

v- no ai

verbal parrot Dec 8, 2025, 12:17 PM

#

hoary mirage vai Equipped with a new understanding of teleporter maintenance, you confidently...

delete

spring lionBOT Dec 8, 2025, 12:17 PM

#

hoary mirage vai Equipped with a new understanding of teleporter maintenance, you confidently...

The problem describes connecting junction boxes in 3D space to form electrical circuits.

Here's the gist:

You're given 3D coordinates for many junction boxes.
Calculate the straight-line distance between every possible pair of junction boxes.
Connect the 1000 pairs that are closest together. When two boxes are connected, they become part of the same circuit. If boxes already in the same circuit are connected, it doesn't change anything.
After making these 1000 connections, identify all the distinct circuits that have formed.
Find the sizes of the three largest circuits and multiply those three sizes together.

-# Response generated by gemini-2.5-flash. AI may be incorrect or misleading.

verbal parrot Dec 8, 2025, 12:17 PM

#

NO

#

DELETE

#

NO SPOILERS

hoary mirage Dec 8, 2025, 12:18 PM

#

THIS IS NOT SPOILER

frigid socket Dec 8, 2025, 12:18 PM

#

faint are you dumb

#

this is puzzle text

verbal parrot Dec 8, 2025, 12:18 PM

#

oh

quartz aurora Dec 8, 2025, 12:18 PM

#

Okay I managed to get this down to 348 bytes (with a big ugly blob of extra garbage output): ||```py
S=[]
Z=sorted
for L in open(n:=0):S+=[map(int,L.split(',')),len(S)],
T=1000
D,=V=[-1]T
R=lambda v:R(V[v])if-1<V[v]else v
for _,i,j in Z((sum((a-b)**2 for a,b in zip(I,J)),i,j)forI,i in S forJ,j in S[:i]):
if n==T:_,p,q,r=Z(dv for d,v in zip(D,V));k=pq*r
A,B=R(i),R(j);n+=1
if A!=B:V[A]=B;D[B]+=D[A]
if-T==D[B]:-print(k,S[i][0]*S[j][0])

frigid socket Dec 8, 2025, 12:18 PM

#

quartz aurora Okay I managed to get this down to 348 bytes (with a big ugly blob of extra garb...

https://betterhelp.com

BetterHelp | Professional Therapy With A Licensed Therapist

BetterHelp offers affordable, convenient online therapy when you need it from licensed, professional therapists. Get help, you deserve to be happy!

#

you have lost it

verbal parrot Dec 8, 2025, 12:19 PM

#

@frigid socket idk if u were being serious about "u cant make 1000 pairs from 1000 boxes" but imagine u have 4 boxes [a,b,c,d]. these are the pairs u can make with them: [(a,b), (a,c), (a,d), (b,c), (c,d)]

frigid socket Dec 8, 2025, 12:19 PM

#

oh icic

#

so instead of calculating the 10 closest you calculate the 1k closest?

verbal parrot Dec 8, 2025, 12:20 PM

#

for puzzle input yes

hoary mirage Dec 8, 2025, 12:20 PM

#

WHY ASK THAT

verbal parrot Dec 8, 2025, 12:21 PM

#

The next two junction boxes are 431,825,988 and 425,690,689. Because these two junction boxes were already in the same circuit, nothing happens!
somehow without this condition my example output is correct but without it it's incorrect

frigid socket Dec 8, 2025, 12:22 PM

#

hoary mirage WHY ASK THAT

if you’re gay it gives you gay

#

@hoary mirage furrykafasi

hoary mirage Dec 8, 2025, 12:22 PM

#

die

native maple Dec 8, 2025, 12:25 PM

#

quartz aurora Okay I managed to get this down to 348 bytes (with a big ugly blob of extra garb...

how fast

quartz aurora Dec 8, 2025, 12:25 PM

#

verbal parrot > The next two junction boxes are 431,825,988 and 425,690,689. Because these two...

I think one of those withouts isn't supposed to be a without

quartz aurora Dec 8, 2025, 12:25 PM

#

native maple how fast

About 2s

native maple Dec 8, 2025, 12:25 PM

#

WHY IS IT SO HARD TO MAKE A FAST ONE TODAY

#

mine runs in 1.5s

verbal parrot Dec 8, 2025, 12:25 PM

#

quartz aurora I think one of those withouts isn't supposed to be a without

oh true lol
somehow without this condition my example output is correct but with it it's incorrect

frigid socket Dec 8, 2025, 12:26 PM

#

HOW doe sthat even work

#

im gonna kill myself

quartz aurora Dec 8, 2025, 12:26 PM

#

native maple mine runs in 1.5s

The top rankers were at 660us/330us last I checked

verbal parrot Dec 8, 2025, 12:26 PM

#

how do u check if there's no public leaderboard anymore

native maple Dec 8, 2025, 12:26 PM

#

probably top rankers for solution speed not solve speed

verbal parrot Dec 8, 2025, 12:27 PM

#

yeah but still how do u see this without global leaderboard

native maple Dec 8, 2025, 12:27 PM

#

quartz aurora The top rankers were at 660us/330us last I checked

im assuming that solution uses a disjoint set or union or whatever

quartz aurora Dec 8, 2025, 12:27 PM

#

verbal parrot yeah but still how do u see this without global leaderboard

Many discords have their own leaderboards

verbal parrot Dec 8, 2025, 12:27 PM

#

oh thought so

quartz aurora Dec 8, 2025, 12:27 PM

#

So there's no way to know the actual global fastest

frigid socket Dec 8, 2025, 12:28 PM

#

@verbal parrot so
||

- find the closest ranking boxes
- put them in the same circuit
- find the closest ranking boxes that aren't in an identical circuit
- do that 1000 times

||

#

is this sane

native maple Dec 8, 2025, 12:28 PM

#

i would use a disjoint set union whatever but that doesnt exist in elle

hoary mirage Dec 8, 2025, 12:28 PM

#

rosieeeeee

native maple Dec 8, 2025, 12:28 PM

#

i dont have scipy or nx or whatever

frigid socket Dec 8, 2025, 12:28 PM

#

faint ghosting me

native maple Dec 8, 2025, 12:28 PM

#

wait

#

would it be faster to use a min heap than to sort by distance

#

@quartz aurora do you see any way to optimize

📎 solution.rs

verbal parrot Dec 8, 2025, 12:29 PM

#

frigid socket <@481532274211422209> so || ``` - find the closest ranking boxes - put them in t...

try following this i guess #1444763777437536368 message

native maple Dec 8, 2025, 12:29 PM

#

wait wrong day

#

📎 solution.rs

frigid socket Dec 8, 2025, 12:29 PM

#

verbal parrot try following this i guess https://discord.com/channels/1015060230222131221/1444...

?remind 5pm

urban ginkgoBOT Dec 8, 2025, 12:29 PM

#

Alright @frigid socket, in 9 hours, 30 minutes and 30 seconds: …

verbal parrot Dec 8, 2025, 12:29 PM

#

i guess "counter" is supposed to be for p2 though

quartz aurora Dec 8, 2025, 12:29 PM

#

The HashSet::from(circuits).size() part looks pretty slow

verbal parrot Dec 8, 2025, 12:30 PM

#

also looking at eagely's delta time i assume p2 is like really easy? can someone confirm

quartz aurora Dec 8, 2025, 12:30 PM

#

Some people also ||spatially partition the inputs so they don't need to generate all the pairs||

native maple Dec 8, 2025, 12:30 PM

#

quartz aurora The `HashSet::from(circuits).size()` part looks pretty slow

that part is actually not very slow

#

the slowest part is the computation of the dists array

quartz aurora Dec 8, 2025, 12:31 PM

#

Yeah

frigid socket Dec 8, 2025, 12:31 PM

#

how do you see delta time @verbal parrot

native maple Dec 8, 2025, 12:31 PM

#

frigid socket how do you see delta time <@481532274211422209>

its an extension

verbal parrot Dec 8, 2025, 12:31 PM

#

i think its an extensin

#

yeah

native maple Dec 8, 2025, 12:31 PM

#

actually

#

i think i know how to make this faster

#

i did this in a very fucked up way

#

position_with is O(n)

#

i can just do a double for loop with .enumerate instead of using T[].combinations

#

and use the indexes from there directly isntead of computing them every time

verbal parrot Dec 8, 2025, 12:33 PM

#

if index1 != -1 && index2 != -1 {
  fmt.Println(pair)
  continue
}

faint@faints-MacBook-Pro 08 % go run 08.go
{{431 825 988} {425 690 689}}
{{906 360 560} {984 92 344}}
24

if index1 != -1 && index2 != -1 {
  // continue
}```

faint@faints-MacBook-Pro 08 % go run 08.go
30

whyyy 😭

#

OH WAIT

#

it says "in the same circuit"

#

omfg

native maple Dec 8, 2025, 12:34 PM

#

ok thats better

verbal parrot Dec 8, 2025, 12:35 PM

#

nvm it still doesnt work

#

fucking hell

native maple Dec 8, 2025, 12:36 PM

#

quartz aurora Some people also ||spatially partition the inputs so they don't need to generate...

what does this mean

quartz aurora Dec 8, 2025, 12:37 PM

#

native maple what does this mean

||Divide input into for example 25x25x25 chunks and only generate pairs within neighboring chunks||

#

||And assume that there's enough points in those to fulfill both tasks' conditions, so that the missing pairs don't matter||

native maple Dec 8, 2025, 12:39 PM

#

oh hmmm

#

interesting

hoary mirage Dec 8, 2025, 12:42 PM

#

how is there single circuits if all of them connect to shortest one to them

verbal parrot Dec 8, 2025, 12:45 PM

#

hoary mirage how is there single circuits if all of them connect to shortest one to them

because you dont need to go thru each pair. it says to only go thru first 10/1000 pairs which means there will be untouched pairs thus not added to circuits and by default they are in a circuit which len is 1

hoary mirage Dec 8, 2025, 1:20 PM

#

native maple ok thats better

so slow

native maple Dec 8, 2025, 1:24 PM

#

you do better then

#

lmao

hoary mirage Dec 8, 2025, 1:26 PM

#

@native maple according to my calculations my solution will take 1 hour 33 minutes

#

ig I can sort

#

sorting is always good option

frigid socket Dec 8, 2025, 1:34 PM

#

mantikafasi mental illness

quartz aurora Dec 8, 2025, 1:34 PM

#

A friend advised me that map(int,L.split(',')) can be more succinctly written as ||eval(L)||, which is extremely based

terse edge Dec 8, 2025, 1:53 PM

#

native maple <@415132870252822539> how long does yours take

few ms i think

terse edge Dec 8, 2025, 1:54 PM

#

verbal parrot <@415132870252822539> what is the example supposed to output?

i posted it somewhere above

#

also make sure ur handling the case where both cables exist in the same box

#

u should count the first time u see them but not the second time

#

the first time you see that exact pair counts

#

if a cable has appeared before but in a different pair it doesnt count

native maple Dec 8, 2025, 1:55 PM

#

quartz aurora A friend advised me that `map(int,L.split(','))` can be more succinctly written ...

THAT IS AWFUL

native maple Dec 8, 2025, 1:58 PM

#

terse edge few ms i think

test perf because you don't do anything special to optimize and mine is 480ms with a similar solution

pale stirrup Dec 8, 2025, 1:59 PM

#

i love a well formatted and documented function

/**
 * Calculates the straight-line distance between this and another [point]
 * in 3-dimensional space, see [euclideanDistance] for 2D points
 *
 * https://en.wikipedia.org/wiki/Euclidean_distance
 */
fun Point3D.distanceTo(point: Point3D): Double {
    return sqrt(
        /* x */ (point.x.toDouble() - x.toDouble()).pow(2) +
        /* y */ (point.y.toDouble() - y.toDouble()).pow(2) +
        /* z */ (point.z.toDouble() - z.toDouble()).pow(2)
    )
}

native maple Dec 8, 2025, 1:59 PM

#

why do you need all of that for a euclidean distance 😭

pale stirrup Dec 8, 2025, 2:00 PM

#

?

hoary mirage Dec 8, 2025, 2:00 PM

#

my solution still hasnt finished

#

love

#

python so slow

frigid socket Dec 8, 2025, 2:01 PM

#

WHY ARE YOU USİNG PYTHON

#

C++

#

or crystal

#

or Vlang

hoary mirage Dec 8, 2025, 2:02 PM

#

nin0 is caveman

frigid socket Dec 8, 2025, 2:02 PM

#

vlang is high level yk

hoary mirage Dec 8, 2025, 2:02 PM

#

ugly

#

and hgorrible langauge server

frigid socket Dec 8, 2025, 2:03 PM

#

It has worked well for me

#

with my solution

native maple Dec 8, 2025, 2:04 PM

#

pale stirrup ?

i did this https://github.com/acquitelol/aoc2025/blob/mistress/solutions/08/solution.le#L19-L22

cloud girderBOT Dec 8, 2025, 2:04 PM

#

native maple i did this https://github.com/acquitelol/aoc2025/blob/mistress/solutions/08/solu...

solution.le: Lines 19-22

for i, box1 in boxes.iter().enumerate() {
    for j, box2 in boxes.iter().enumerate() {
        if i >= j { continue; }
        dist := box1.to_vec3().sub(box2.to_vec3()).length_sq();

native maple Dec 8, 2025, 2:04 PM

#

rate

#

you don't even need the whole distance it's enough to use the distance squared

pale stirrup Dec 8, 2025, 2:06 PM

#

i have it extracted to a util so it needs to work for more than just this one puzzle

#

maze tomorrow 🤞

verbal parrot Dec 8, 2025, 2:12 PM

#

terse edge also make sure ur handling the case where both cables exist in the same box

these are all the cases im handling isnt it enough
||```go
if len(circuits) == 0 {
circuits = append(circuits, make([]Vec3, 2))
circuits[0][0] = pair.a
circuits[0][1] = pair.b
continue
}

    index1 := find(&circuits, pair.a)
    index2 := find(&circuits, pair.b)

    if index1 == -1 && index2 == -1 {
        circuits = append(circuits, make([]Vec3, 2))
        circuits[len(circuits)-1][0] = pair.a
        circuits[len(circuits)-1][1] = pair.b
        continue
    }

    if index1 == index2 {
        continue
    }

    if index1 != -1 {
        circuits[index1] = append(circuits[index1], pair.b)
    } else if index2 != -1 {
        circuits[index2] = append(circuits[index2], pair.a)
    }

#

smart peopll #HELP

pale stirrup Dec 8, 2025, 2:14 PM

#

asking the wrong server ykyk

verbal parrot Dec 8, 2025, 2:14 PM

#

erm

verbal parrot Dec 8, 2025, 2:15 PM

#

terse edge <@581573474296791211> and whoever else didnt do it yet, im not spoilering it bec...

see a and b, do nothing, still increment the counter
see a and b, do nothing, dont increment the counter
wait im kinda confused how can u encounter the same pair twice?

pale stirrup Dec 8, 2025, 2:16 PM

#

a, b and b, a

verbal parrot Dec 8, 2025, 2:17 PM

#

dont increment the counter = dont count the current pair to these 10 pairs?

#

or well 1000 for the real input

pale stirrup Dec 8, 2025, 2:17 PM

#

honestly idk what counter eagely was talking about

verbal parrot Dec 8, 2025, 2:18 PM

#

why does it not work 😭
||```go
type Vec3 struct {
x, y, z int
}

type Pair struct {
a, b Vec3
}

func (v1 Vec3) distance(v2 Vec3) int {
sum := (v1.x-v2.x)(v1.x-v2.x) + (v1.y-v2.y)(v1.y-v2.y) + (v1.z-v2.z)*(v1.z-v2.z)
return int(math.Abs(math.Sqrt(float64(sum))))
}

func pairs(fileName string) []Pair {
var vecs []Vec3
var pairs []Pair

file, _ := os.Open(fileName)
defer file.Close()

scanner := bufio.NewScanner(file)

for scanner.Scan() {
    xyz := strings.Split(scanner.Text(), ",")
    x, _ := strconv.Atoi(xyz[0])
    y, _ := strconv.Atoi(xyz[1])
    z, _ := strconv.Atoi(xyz[2])

    vecs = append(vecs, Vec3{x, y, z})
}

for index, vec := range vecs {
    for j := index + 1; j < len(vecs); j++ {
        pairs = append(pairs, Pair{vec, vecs[j]})
    }
}

return pairs

}

func sort_pairs(pairs []Pair) {
sort.Slice(pairs, func(i, j int) bool {
return pairs[i].a.distance(pairs[i].b) < pairs[j].a.distance(pairs[j].b)
})
}

type Circuits struct {
dict map[int]int
}

func find(circuits *[][]Vec3, vec Vec3) int {
for i, circuit := range *circuits {
if slices.Contains(circuit, vec) {
return i
}
}
return -1
}

func puzzle(pairs *[]Pair) int {
var circuits [][]Vec3
for i, pair := range *pairs {
if i > 9 {
break
}

    if len(circuits) == 0 {
        circuits = append(circuits, make([]Vec3, 2))
        circuits[0][0] = pair.a
        circuits[0][1] = pair.b
        continue
    }

    index1 := find(&circuits, pair.a)
    index2 := find(&circuits, pair.b)

    if index1 == -1 && index2 == -1 {
        circuits = append(circuits, make([]Vec3, 2))
        circuits[len(circuits)-1][0] = pair.a
        circuits[len(circuits)-1][1] = pair.b
        continue
    }

    if index1 == index2 {
        continue
    }

    if index1 != -1 {
        circuits[index1] = append(circuits[index1], pair.b)
    } else if index2 != -1 {
        circuits[index2] = append(circuits[index2], pair.a)
    }
}

sort.Slice(circuits, func(i, j int) bool {
    return len(circuits[i]) > len(circuits[j])
})

return len(circuits[0]) * len(circuits[1]) * len(circuits[2])

}

func main() {
pairs := pairs("input")
sort_pairs(pairs)
fmt.Println(puzzle(&pairs))
}

pale stirrup Dec 8, 2025, 2:18 PM

#

i don't have a counter

verbal parrot Dec 8, 2025, 2:21 PM

#

this is what it looks like for me for example input (first line is the current pair, next line is lengths of circuits X times)

{{162 817 812} {425 690 689}}
2
{{162 817 812} {431 825 988}}
3
{{906 360 560} {805 96 715}}
3 2
{{431 825 988} {425 690 689}}
3 2
{{862 61 35} {984 92 344}}
3 2 2
{{52 470 668} {117 168 530}}
3 2 2 2
{{819 987 18} {941 993 340}}
3 2 2 2 2
{{906 360 560} {739 650 466}}
3 3 2 2 2
{{346 949 466} {425 690 689}}
4 3 2 2 2
{{906 360 560} {984 92 344}}
4 4 2 2 2
{{592 479 940} {425 690 689}}
4 4 2 2 2```

#

which kinda... makes sense to me?

#

but it seems to be wrong

#

but if i remove the if index1 == index2 { continue } it works

#

fucking how

terse edge Dec 8, 2025, 2:29 PM

#

verbal parrot > see a and b, do nothing, still increment the counter > see a and b, do nothing...

visited set to make sure u dont

#

or just take only the first thousand pairs and loop over them

pale stirrup Dec 8, 2025, 2:30 PM

#

Made fancy loading indicator

verbal parrot Dec 8, 2025, 2:42 PM

#

oh my fucking god finally

That's the right answer! You are one gold star closer to decorating the North Pole. [Continue to Part Two]

robust yacht Dec 8, 2025, 2:43 PM

#

@pale stirrup

#

you weren't supposed to get it until after I got it

verbal parrot Dec 8, 2025, 2:43 PM

#

this was the case i didnt handle right (or didnt handle entirely):
||go if index1 != -1 && index2 != -1 { circuits[index1] = append(circuits[index1], circuits[index2]...) circuits[index2] = make([]Vec3, 0) continue }||

robust yacht Dec 8, 2025, 2:43 PM

#

wing cheating

pale stirrup Dec 8, 2025, 2:45 PM

#

i did just copy one of eagely's utils actually (credited though)

robust yacht Dec 8, 2025, 2:45 PM

#

guh

verbal parrot Dec 8, 2025, 2:59 PM

#

p2 done!!!

That's the right answer! You are one gold star closer to decorating the North Pole.

You have completed Day 8! You can [Share] this victory or [Return to Your Advent Calendar].

native maple Dec 8, 2025, 2:59 PM

#

THATS MORE LIKE IT

verbal parrot Dec 8, 2025, 2:59 PM

#

also i now get what eagely meant by counter

feral valve Dec 8, 2025, 2:59 PM

#

i should look up how to do closest pair efficiently

robust yacht Dec 8, 2025, 3:00 PM

#

native maple THATS MORE LIKE IT

too slow still

verbal parrot Dec 8, 2025, 3:00 PM

#

faint@faints-MacBook-Pro 08 % hyperfine -N 'go run 08.go'
Benchmark 1: go run 08.go
  Time (mean ± σ):     184.9 ms ±  93.8 ms    [User: 155.0 ms, System: 73.2 ms]
  Range (min … max):   153.2 ms … 451.9 ms    10 runs

wait how did it get so fast my p1 only code was 15s

native maple Dec 8, 2025, 3:00 PM

#

robust yacht too slow still

how long does yours take

#

ok thats better

verbal parrot Dec 8, 2025, 3:03 PM

#

my next lang is pascal

robust yacht Dec 8, 2025, 3:03 PM

#

native maple how long does yours take

I haven't finished

native maple Dec 8, 2025, 3:04 PM

#

all solutions in 300ms

#

i will take that

hoary mirage Dec 8, 2025, 3:14 PM

#

@native maple still hasnt calculated

#

waiting

#

it should finish soon

#

I could just make a array for smallest 1000 connections but too lazy

vestal owl Dec 8, 2025, 3:28 PM

#

goddamit bubble sort

native maple Dec 8, 2025, 3:30 PM

#

is that 350 seconds 😭

vestal owl Dec 8, 2025, 3:31 PM

#

yes

lusty atlas Dec 8, 2025, 3:33 PM

#

IS TODAY DIJKSTRA DAY

dusky frost Dec 8, 2025, 3:33 PM

#

nah

native maple Dec 8, 2025, 3:39 PM

#

lusty atlas IS TODAY DIJKSTRA DAY

not yet

robust yacht Dec 8, 2025, 3:40 PM

#

never i hope

vestal owl Dec 8, 2025, 3:49 PM

#

native maple is that 350 seconds 😭

qsort fixes this

#

haha

hoary mirage Dec 8, 2025, 3:50 PM

#

COME ON END ALREADY

#

I AM GOING INSANE

vestal owl Dec 8, 2025, 3:52 PM

#

hoary mirage COME ON END ALREADY

use a better algo

#

baka

hoary mirage Dec 8, 2025, 3:53 PM

#

my algo is peak

native maple Dec 8, 2025, 3:53 PM

#

vestal owl qsort fixes this

HOW IS IT ALREADY FASTER THAN MINE

hoary mirage Dec 8, 2025, 3:54 PM

#

native maple HOW IS IT ALREADY FASTER THAN MINE

elle slow rosie

native maple Dec 8, 2025, 3:54 PM

#

well i think its partly my stuff heap allocating

robust yacht Dec 8, 2025, 3:56 PM

#

elle slow

#

@hoary mirage make elle fast

hoary mirage Dec 8, 2025, 3:56 PM

#

impossible

vestal owl Dec 8, 2025, 3:58 PM

#

p2 was way too easy

#

it's like 2 lines apart from p1

native maple Dec 8, 2025, 4:04 PM

#

@lusty atlas how fast mine on your machine https://github.com/acquitelol/aoc2025/blob/mistress/solutions/08/solution.le

GitHub

aoc2025/solutions/08/solution.le at mistress · acquitelol/aoc2025

My Advent of Code 2025 solutions in Elle. Contribute to acquitelol/aoc2025 development by creating an account on GitHub.

robust yacht Dec 8, 2025, 4:05 PM

#

@native maple you didnt ask me you hate me

#

#

elle so bad

#

soooo broke

#

fixx

native maple Dec 8, 2025, 4:07 PM

#

wtf

dusky frost Dec 8, 2025, 4:07 PM

#

identifier too long

#

I remember that error

robust yacht Dec 8, 2025, 4:08 PM

#

3.2k lines elle so bloated

#

rewrirte

vestal owl Dec 8, 2025, 4:08 PM

#

both parts take this long

#

ugh

native maple Dec 8, 2025, 4:09 PM

#

oh ok its not faster than mine

#

mine takes 100ms for both

native maple Dec 8, 2025, 4:09 PM

#

robust yacht 3.2k lines elle so bloated

?????? its ssa what do you expect

vestal owl Dec 8, 2025, 4:10 PM

#

native maple mine takes 100ms for both

?

robust yacht Dec 8, 2025, 4:10 PM

#

native maple ?????? its ssa what do you expect

idk what ssa is

native maple Dec 8, 2025, 4:10 PM

#

single static assignment

robust yacht Dec 8, 2025, 4:10 PM

#

idk what that is

vestal owl Dec 8, 2025, 4:10 PM

#

compiler optimization

#

basically it keeps every mutation in a new variable (not quite but that's the basic idea)

robust yacht Dec 8, 2025, 4:11 PM

#

o

#

@native maple how fix

vestal owl Dec 8, 2025, 4:11 PM

#

anyways i should use stdlib's qsort more often

#

it's way too helpful

#

and takes a comparison function too

#

#

and __compar_fn_t takes in 2 void* params and outputs -1, 0 or +1

vestal owl Dec 8, 2025, 4:13 PM

#

native maple oh ok its not faster than mine

???????????????

#

bro cant math 😭

robust yacht Dec 8, 2025, 4:14 PM

#

well

#

roie does like lambda calculus for fun theyre insane

vestal owl Dec 8, 2025, 4:16 PM

#

incredible

native maple Dec 8, 2025, 4:16 PM

#

robust yacht <@581573474296791211> how fix

go to your qbe clone, go to all.h, make NString bigger, make again and replace ur qbe

vestal owl Dec 8, 2025, 4:16 PM

#

anyways -Ofast helps a bit too

native maple Dec 8, 2025, 4:16 PM

#

vestal owl both parts take this long

i thought you meant each part takes this long

robust yacht Dec 8, 2025, 4:16 PM

#

native maple go to your qbe clone, go to `all.h`, make NString bigger, `make` again and repla...

yes my lord

vestal owl Dec 8, 2025, 4:16 PM

#

native maple i thought you meant each part takes this long

i could have worded that better

robust yacht Dec 8, 2025, 4:17 PM

#

oh

#

guhh ill have to compil qbe manually

vestal owl Dec 8, 2025, 4:17 PM

#

anyways i like how this turned out

📎 d8.c

robust yacht Dec 8, 2025, 4:17 PM

#

i dont like installing system packages like this

native maple Dec 8, 2025, 4:18 PM

#

honestly even though my solution is slower by 20ms i think i prefer the elegance of being able to do this ||https://github.com/acquitelol/aoc2025/blob/mistress/solutions/08/solution.le#L40-L49||

cloud girderBOT Dec 8, 2025, 4:18 PM

#

native maple honestly even though my solution is slower by 20ms i think i prefer the elegance...

solution.le: Lines 40-49

if step == 999 {
    counts := HashMap::new<i64, i64>();
    for c in 0..boxes.len() {
        root := find(circuits, c);
        counts[root] = counts.get(root).unwrap_or(0) + 1;
    }

    largest := counts.iter().collect().sort_with(fn(a, b) b.y - a.y).slice(0, 3);
    total[0] = largest.iter().map(fn(c) c.y).product();
}

native maple Dec 8, 2025, 4:18 PM

#

huh

#

guh

robust yacht Dec 8, 2025, 4:18 PM

#

elle 2

#

roieee

native maple Dec 8, 2025, 4:18 PM

#

robust yacht guhh ill have to compil qbe manually

oh you didn't already do that?

robust yacht Dec 8, 2025, 4:18 PM

#

nop

#

using pacman repos version

native maple Dec 8, 2025, 4:18 PM

#

i forget some people just install qbe blindly

vestal owl Dec 8, 2025, 4:18 PM

#

cloud girder **solution.le:** Lines 40-49 ```le if step == 999 { counts := HashMap::new<i...

i basically did that but more verbose

native maple Dec 8, 2025, 4:18 PM

#

it's fine building it yourself is like dead easy if ur on linux

robust yacht Dec 8, 2025, 4:19 PM

#

elle should maybe submodule qbe if qbe is gonna be broken like that

native maple Dec 8, 2025, 4:19 PM

#

robust yacht elle should maybe submodule qbe if qbe is gonna be broken like that

i need to do that yes

#

i will

robust yacht Dec 8, 2025, 4:19 PM

#

qbe in elle when

native maple Dec 8, 2025, 4:19 PM

#

because that way i can also add inline asm

vestal owl Dec 8, 2025, 4:19 PM

#

i don't think i've ever used the qsort function until now

native maple Dec 8, 2025, 4:19 PM

#

vestal owl i basically did that but more verbose

yeah i think i'll take the 20ms hit for the simplicity tbh

robust yacht Dec 8, 2025, 4:19 PM

#

huskkk

#

qbe using long long

vestal owl Dec 8, 2025, 4:20 PM

#

native maple yeah i think i'll take the 20ms hit for the simplicity tbh

worth tbh

#

also can you try to run it on your computer too

#

with -Ofast -lm

native maple Dec 8, 2025, 4:20 PM

#

sure hold on

robust yacht Dec 8, 2025, 4:20 PM

#

i think i need your input

native maple Dec 8, 2025, 4:20 PM

#

robust yacht

pass a file

robust yacht Dec 8, 2025, 4:21 PM

#

give your input i dont have mine solved yet

native maple Dec 8, 2025, 4:21 PM

#

it takes the file from args[1] i didn't bother to add help message

robust yacht Dec 8, 2025, 4:21 PM

#

@native maple@native maple make a aoc solution wrapper thing

#

mine are all contained as one program

#

inputs are stored in the resources

#

inputt @native maple give

native maple Dec 8, 2025, 4:23 PM

#

robust yacht <@581573474296791211><@581573474296791211> make a aoc solution wrapper thing

i dont commit the input

#

📎 input.txt

robust yacht Dec 8, 2025, 4:24 PM

#

SLOW

native maple Dec 8, 2025, 4:24 PM

#

vestal owl also can you try to run it on your computer too

ill try your solution when i get in the car hold on

native maple Dec 8, 2025, 4:24 PM

#

robust yacht SLOW

compile with --nogc

#

guh

robust yacht Dec 8, 2025, 4:24 PM

#

native maple Dec 8, 2025, 4:24 PM

#

do you have updated elle

robust yacht Dec 8, 2025, 4:24 PM

#

native maple ill try your solution when i get in the car hold on

dont drive and code

#

yes

native maple Dec 8, 2025, 4:25 PM

#

guh

robust yacht Dec 8, 2025, 4:25 PM

#

it solves without --nogc

#

but slow

native maple Dec 8, 2025, 4:25 PM

#

it should solve without gc too whatttt

#

do you know how to use gdb

robust yacht Dec 8, 2025, 4:26 PM

#

yes

native maple Dec 8, 2025, 4:26 PM

#

can you send bt

robust yacht Dec 8, 2025, 4:26 PM

#

i will try

#

how compile with debug symbols @native maple

native maple Dec 8, 2025, 4:27 PM

#

you just need to gdb ./solution then r input.txt then when it crashes bt and send

native maple Dec 8, 2025, 4:27 PM

#

robust yacht how compile with debug symbols <@581573474296791211>

uhhhh you don't

robust yacht Dec 8, 2025, 4:27 PM

#

oh okay

#

good luck interpreting this

#0  0x00007ffff7da82e4 in ?? () from /usr/lib/libc.so.6
#1  0x000055555555f945 in ArenaAllocator.realloc ()
#2  0x0000555555564b3a in ArbitraryAllocator.realloc ()
#3  0x000055555555977b in Array.resize.0.Triple.0.13.7.7.1.1 ()
#4  0x000055555555c607 in Array.push.0.Triple.0.13.7.7.1.1 ()
#5  0x00005555555560c0 in MinHeap.push.0.Triple.0.13.7.7.1.1 ()
#6  0x000055555555582f in solve ()
#7  0x000055555555b388 in __internal.elle.__main__ ()
#8  0x000055555555741c in main ()

native maple Dec 8, 2025, 4:28 PM

#

no that's helpful

#

thank you

robust yacht Dec 8, 2025, 4:28 PM

#

how

#

okay

native maple Dec 8, 2025, 4:29 PM

#

because that means it's fucking up when reallocating an arena region to be bigger, maybe you OOM

robust yacht Dec 8, 2025, 4:29 PM

#

how

#

i have 64 gb

native maple Dec 8, 2025, 4:29 PM

#

try add use std/heap_allocator; at the top and then #set_allocator(HeapAllocator::new()); at the start of main() and see if it works

#

i can probably reproduce on my machine hold on

lusty atlas Dec 8, 2025, 4:31 PM

#

robust yacht i have 64 gb

;)

#

not anymore

robust yacht Dec 8, 2025, 4:31 PM

#

use std/heap_allocator;

lusty atlas Dec 8, 2025, 4:31 PM

#

zt doesn't realise he got scammed and his ram is really only 8gb but manipulated to report itself as 64gb

robust yacht Dec 8, 2025, 4:32 PM

#

ROIEE

#

native maple Dec 8, 2025, 4:33 PM

#

oh

hoary mirage Dec 8, 2025, 4:33 PM

#

lusty atlas zt doesn't realise he got scammed and his ram is really only 8gb but manipulated...

he is 8000$ in loss

native maple Dec 8, 2025, 4:33 PM

#

guh look at the error above

#

use std/allocators/heap_allocator;

robust yacht Dec 8, 2025, 4:33 PM

#

use std/allocators/heap_allocator;

#

@native maple

lusty atlas Dec 8, 2025, 4:33 PM

#

rosie doesn't know her own language

robust yacht Dec 8, 2025, 4:34 PM

#

roie fail

native maple Dec 8, 2025, 4:34 PM

#

oh im restarted

#

use std/allocators/heap;

#

in my defense i never use this allocator

#

and im on mobile

lusty atlas Dec 8, 2025, 4:35 PM

#

rosie is asking ai how to fix this error @robust yacht

robust yacht Dec 8, 2025, 4:35 PM

#

yop

#

rosie has a prompt trained on elle

lusty atlas Dec 8, 2025, 4:35 PM

#

robust yacht <@581573474296791211>

vai how to fix this error please?

robust yacht Dec 8, 2025, 4:36 PM

#

@native maple

spring lionBOT Dec 8, 2025, 4:36 PM

#

lusty atlas vai how to fix this error please?

The error you're encountering has two main parts:

"Could not load module std/allocators/heap_allocator: No such file or directory (os error 2)"
This indicates that the compiler or runtime cannot find the heap_allocator module, likely because it's missing, misplaced, or the path to it is incorrect. This is similar to a "ModuleNotFoundError" in other languages.
"Identifier 'HeapAllocator' isn't a struct or primitive type."
This means the HeapAllocator type is not recognized in the scope where it's being used. This could be due to:
- Incorrect spelling (though the error asks if you spelled it correctly, it's worth double-checking).
- The module containing HeapAllocator not being properly imported or linked.
- HeapAllocator not being a public or exported type from its module.
- Version compatibility issues if using external libraries.

To fix this, consider the following:

Check Module Availability and Path: Ensure that the std/allocators/heap_allocator module actually exists at the expected location. If it's part of a library, confirm the library is correctly installed and accessible by your build system.
Correct Imports/Includes: Verify that you have the necessary import statements or include directives for the HeapAllocator type and its module in your solution.le file.
Build System Configuration: If you are using a build system (like Cargo for Rust, which sometimes uses "alloc" or "heap" crates), ensure it's configured to include and link against the std/allocators module or the specific HeapAllocator type.
Spelling and Casing: Double-check that HeapAllocator is spelled and cased exactly as defined in its source.
Compatibility: If HeapAllocator is from an external source, ensure its version is compatible with your project's other dependencies and compi…

-# Response generated by gemini-2.5-flash. AI may be incorrect or misleading.

hoary mirage Dec 8, 2025, 4:36 PM

#

vai help me

spring lionBOT Dec 8, 2025, 4:36 PM

#

hoary mirage vai help me

Hello! How can I help you? I'm here to assist with Vencord-related questions, or anything else you might need. Please tell me what you're looking for!

-# Response generated by gemini-2.5-flash. AI may be incorrect or misleading.

robust yacht Dec 8, 2025, 4:36 PM

#

how compile with max optimization

hoary mirage Dec 8, 2025, 4:36 PM

#

my code works on example

lusty atlas Dec 8, 2025, 4:36 PM

#

robust yacht <@581573474296791211>

SLOW

hoary mirage Dec 8, 2025, 4:36 PM

#

HOWEVER ON REAL INPUT IT ALL BECOMES ONE GIANT CIRCUT AT LIKE INDX 993

robust yacht Dec 8, 2025, 4:37 PM

#

ok faster now

hoary mirage Dec 8, 2025, 4:37 PM

#

@native maple help

robust yacht Dec 8, 2025, 4:37 PM

#

i just switched to performance plan

lusty atlas Dec 8, 2025, 4:37 PM

#

hoary mirage HOWEVER ON REAL INPUT IT ALL BECOMES ONE GIANT CIRCUT AT LIKE INDX 993

did you forget to initialise array again

hoary mirage Dec 8, 2025, 4:37 PM

#

USING PYTHON

lusty atlas Dec 8, 2025, 4:38 PM

#

good

native maple Dec 8, 2025, 4:38 PM

#

robust yacht

???? ok i cant reproduce

#

your computer is just bad

robust yacht Dec 8, 2025, 4:38 PM

#

nop

native maple Dec 8, 2025, 4:39 PM

#

wait try run it with arena allocator again

#

maybe it was just a fluke

#

just get rid of the heap allocator stuff run with --nogc tho

lusty atlas Dec 8, 2025, 4:39 PM

#

@hoary mirage

lusty atlas Dec 8, 2025, 4:40 PM

#

robust yacht

🚌 error

hoary mirage Dec 8, 2025, 4:42 PM

#

@native maple can I not merge circuits

native maple Dec 8, 2025, 4:42 PM

#

you can

hoary mirage Dec 8, 2025, 4:42 PM

#

THEN WHY DOES IT ALL BECOME ONE HUGE CIRCIUT

native maple Dec 8, 2025, 4:42 PM

#

||https://github.com/acquitelol/aoc2025/blob/bc317bd75b96b069471c4f65f5027c4b65d08b9f/solutions/08/solution.le#L3-L9||

cloud girderBOT Dec 8, 2025, 4:42 PM

#

native maple ||https://github.com/acquitelol/aoc2025/blob/bc317bd75b96b069471c4f65f5027c4b65d...

solution.le: Lines 3-9
||```le
fn merge(i64[] circuits, i64 d1, i64 d2) {
c1, c2 := $(circuits[d1], circuits[d2]);
if c1 == c2 { return; }
for i, c in circuits.iter().enumerate() {
if c == c2 { circuits[i] = c1; }
}
}

robust yacht Dec 8, 2025, 4:42 PM

#

native maple maybe it was just a fluke

nop

native maple Dec 8, 2025, 4:42 PM

#

i did that originally

robust yacht Dec 8, 2025, 4:42 PM

#

same thing

robust yacht Dec 8, 2025, 4:43 PM

#

cloud girder **solution.le:** Lines 3-9 ||```le fn merge(i64[] circuits, i64 d1, i64 d2) { ...

UNREADABLE

#

rosie is allergic to readable variable names

native maple Dec 8, 2025, 4:43 PM

#

no its pretty readable..

robust yacht Dec 8, 2025, 4:43 PM

#

what is the d in d1

native maple Dec 8, 2025, 4:43 PM

#

wow

hoary mirage Dec 8, 2025, 4:43 PM

#

well it doesnt work

native maple Dec 8, 2025, 4:43 PM

#

congrats

hoary mirage Dec 8, 2025, 4:43 PM

#

no need to spoiler

#

anyway rosie fix soon

robust yacht Dec 8, 2025, 4:44 PM

#

rosie fix

native maple Dec 8, 2025, 4:46 PM

#

@robust yacht fix https://github.com/acquitelol/elle/blob/rewrite/std/runtime/allocators/arena.le#L69-L84

cloud girderBOT Dec 8, 2025, 4:46 PM

#

native maple <@289556910426816513> fix https://github.com/acquitelol/elle/blob/rewrite/std/ru...

arena.le: Lines 69-84

fn ArenaAllocator::realloc(ArenaAllocator *self, void *ptr, i32 _new_size) {
    // if nil is passed assume its an allocation instead of reallocation
    if !ptr {
        return self.alloc(_new_size);
    }

    // else alloc and copy old data
    let new_size = __internal_alloc_align8(_new_size);
    let new_ptr = self.alloc(new_size);

    // copy memory from old buffer to new buffer
    mem::memcpy(new_ptr, ptr, _new_size);

    // do NOT free, managed by arena allocator
    return new_ptr;
}

robust yacht Dec 8, 2025, 4:47 PM

#

okay

native maple Dec 8, 2025, 4:47 PM

#

thanks

#

i have a feeling memcpy is somehow causing the crash

#

since it fails in ?? in libc going straight from ArenaAllocator::realloc

robust yacht Dec 8, 2025, 4:51 PM

#

maybe bounds check wrong

native maple Dec 8, 2025, 4:51 PM

#

which means somehow my new size is wrong

#

what bounds check

robust yacht Dec 8, 2025, 4:51 PM

#

native maple Dec 8, 2025, 4:55 PM

#

oh i see

#

well thats wrong but idk why thats causing a bus error there

robust yacht Dec 8, 2025, 4:56 PM

#

ive never seen a bus error

#

rosie trying to read my password from ram

native maple Dec 8, 2025, 4:57 PM

#

i see the issue

#

memcpy is copying from the old ptr more memory than was allocated

#

mem::memcpy(new_ptr, ptr, new_size);

robust yacht Dec 8, 2025, 4:57 PM

#

FIX

native maple Dec 8, 2025, 4:57 PM

#

its copying new_size bytes but ptr is smaller than that

#

idk how to keep track of that

robust yacht Dec 8, 2025, 4:58 PM

#

wdym

#

oh

#

that responsibly would be on the caller wouldnt it though?

#

wait

native maple Dec 8, 2025, 4:59 PM

#

no

robust yacht Dec 8, 2025, 4:59 PM

#

is your memcpy(src, dst, size) or dst src size

native maple Dec 8, 2025, 4:59 PM

#

its dst src size

#

but ptr is the old buffer

#

which is smaller than new_ptr

#

but its copying new_size

#

so its copying memory out of bounds from ptr

robust yacht Dec 8, 2025, 5:00 PM

#

new_size is how many bytes to copy

native maple Dec 8, 2025, 5:00 PM

#

i know how to fix

native maple Dec 8, 2025, 5:00 PM

#

robust yacht new_size is how many bytes to copy

yes

#

but thats new_ptr's size

#

ptr is smaller which is the src

#

so its copying extra bytes

robust yacht Dec 8, 2025, 5:00 PM

#

native maple but thats new_ptr's size

thats the callers fault then

native maple Dec 8, 2025, 5:01 PM

#

no lol because you would call realloc with a bigger size than the old buffer

#

thats how any dynamic data structure is implemented

robust yacht Dec 8, 2025, 5:01 PM

#

idk it seems wrong to me

native maple Dec 8, 2025, 5:01 PM

#

i just need to copy the size of the old ptr instead and leave the extra space uninitialized

robust yacht Dec 8, 2025, 5:01 PM

#

idk

#

do

#

roinga

native maple Dec 8, 2025, 5:05 PM

#

lmao

dusky frost Dec 8, 2025, 5:13 PM

#

good results

native maple Dec 8, 2025, 5:16 PM

#

success

cloud iron Dec 8, 2025, 5:21 PM

#

i don't like d8p1

#

starts out by being annoying

native maple Dec 8, 2025, 5:29 PM

#

ok @robust yacht pull from elle and rebuild and then try now

robust yacht Dec 8, 2025, 5:29 PM

#

okay

#

it works @native maple

#

blobcatcozy~2

native maple Dec 8, 2025, 5:30 PM

#

cool

#

i just allocate an extra i64 to store the size of the allocation and then do pointer arithmetic to go back and get that size when you realloc lol

robust yacht Dec 8, 2025, 5:36 PM

#

roingaaa 😭

lusty atlas Dec 8, 2025, 5:47 PM

#

cloud girder **arena.le:** Lines 69-84 ```le fn ArenaAllocator::realloc(ArenaAllocator *self,...

fym do not free 😭

#

does it keep all allocations until the program exits

hoary mirage Dec 8, 2025, 5:48 PM

#

That's the right answer! You are one gold star closer to decorating the North Pole.

#

looove

lusty atlas Dec 8, 2025, 5:48 PM

#

insane

hoary mirage Dec 8, 2025, 5:50 PM

#

2.4 sec both parts

robust yacht Dec 8, 2025, 5:50 PM

#

slow

hoary mirage Dec 8, 2025, 5:50 PM

#

ITS PYTHON WHAT DO I DO

robust yacht Dec 8, 2025, 5:50 PM

#

idk

hoary mirage Dec 8, 2025, 5:50 PM

#

wait using python3 is faster

#

1.6 secs

lusty atlas Dec 8, 2025, 5:50 PM

#

oh my god today is insane

#

actually not too bad ig

hoary mirage Dec 8, 2025, 5:53 PM

#

only insane if ur huge noob

#

eric so bad

#

The next two junction boxes are 431,825,988 and 425,690,689. Because these two junction boxes were already in the same circuit, nothing happens!

#

this line

#

worst

#

you still gotta count it

cloud iron Dec 8, 2025, 5:56 PM

#

hoary mirage ITS PYTHON WHAT DO I DO

in doubt, use numpy

lusty atlas Dec 8, 2025, 5:56 PM

#

i think today p1 very easy

#

but will go toilert first

robust yacht Dec 8, 2025, 5:56 PM

#

wtf how does the example end up with 11 circuits after making 10 connections

#

??

hoary mirage Dec 8, 2025, 5:57 PM

#

cloud iron in doubt, use numpy

Nop

native maple Dec 8, 2025, 5:57 PM

#

lusty atlas does it keep all allocations until the program exits

yes

hoary mirage Dec 8, 2025, 5:57 PM

#

robust yacht wtf how does the example end up with `11` circuits after making `10` connections

All junction boxes are one circuit

native maple Dec 8, 2025, 5:57 PM

#

because the program runtime is short

hoary mirage Dec 8, 2025, 5:57 PM

#

Until merged

native maple Dec 8, 2025, 5:57 PM

#

the intended use of the arena allocator is to create multiple and free them individually

cloud iron Dec 8, 2025, 5:57 PM

#

robust yacht wtf how does the example end up with `11` circuits after making `10` connections

https://www.rxddit.com/r/adventofcode/comments/1phiks9

rxddit.com

[2025 Day 8 (Part 1)] PSA

u/QultrosSanhattan on r/adventofcode

A connection can merge two existing groups that have no elements in common into one. For example:

Set 1: {A, B, C}
Set 2: {D, E, F}
Instruction: connect C and D
Result:
- New Set: {A, B, C, D, E, F}

I lost about 4 hours not realizing this. This “hidden” but logical rule is not explicitly mentioned anywher...

lusty atlas Dec 8, 2025, 5:57 PM

#

native maple yes

why even free then

exit without freeing anything

#

OS will handle ykyk

hoary mirage Dec 8, 2025, 5:58 PM

#

Elle memory leak

robust yacht Dec 8, 2025, 5:58 PM

#

oh do i need to fill the circuits with each junction box initially on its own circuit then merge

lusty atlas Dec 8, 2025, 5:58 PM

#

hoary mirage Elle memory leak

IT'S ALREADY MEMORY LEAK BY DESIGN

hoary mirage Dec 8, 2025, 5:58 PM

#

You choose

#

If ur gonna start with 0 circuits it doesnt matter

#

Ignore 11 part

cloud iron Dec 8, 2025, 5:59 PM

#

lusty atlas i think today p1 very easy

if you know the DSA
and despite being a nerd, i didn't know today's
i mean i knew ||MST||, hard heard of it, but didn't knew ||DSU|| or ||Kruskal's algorithm||

#

so today is a wikipedia day for me

hoary mirage Dec 8, 2025, 5:59 PM

#

What are these words

#

Eagely alt

lusty atlas Dec 8, 2025, 5:59 PM

#

do circuits have to be one straight line or can they be funny shape

native maple Dec 8, 2025, 5:59 PM

#

lusty atlas why even free then exit without freeing anything

youre meant to use it like this

fn main() {
    // the base arena exists by default
    for i in 0..100 { // the iterator allocates
        #set_allocator(arena := ArenaAllocator::new());
        do_expensive_thing();
        arena.free_self();
        #reset_allocator();
    }
}
``` it just so happens that i dont create any temporary arenas

cloud iron Dec 8, 2025, 5:59 PM

#

funni shape

native maple Dec 8, 2025, 6:00 PM

#

but the intended usecase of them is that

hoary mirage Dec 8, 2025, 6:00 PM

#

There is no funny shape

robust yacht Dec 8, 2025, 6:00 PM

#

share

native maple Dec 8, 2025, 6:00 PM

#

and if you dont use gc, there is just one big arena by default

cloud iron Dec 8, 2025, 6:00 PM

#

there's even a nice visualization on reddit

lusty atlas Dec 8, 2025, 6:00 PM

#

so you can connect to circuits in the middle

cloud iron Dec 8, 2025, 6:00 PM

#

lusty atlas so you can connect to circuits in the middle

yes

hoary mirage Dec 8, 2025, 6:00 PM

#

It doesnt matter

#

You will add them to same circuit

terse edge Dec 8, 2025, 6:01 PM

#

pale stirrup i did just copy one of eagely's utils actually (credited though)

which one

robust yacht Dec 8, 2025, 6:03 PM

#

how close

hoary mirage Dec 8, 2025, 6:30 PM

#

@lusty atlas solve already its been 3 yeras

native maple Dec 8, 2025, 6:30 PM

#

@hoary mirage solve already its been 4 years

hoary mirage Dec 8, 2025, 6:30 PM

#

native maple <@287555395151593473> solve already its been 4 years

I SOLVED

#

both parts :)

native maple Dec 8, 2025, 6:32 PM

#

how fast @hoary mirage

hoary mirage Dec 8, 2025, 6:37 PM

#

native maple how fast <@287555395151593473>

1.6 sec both

native maple Dec 8, 2025, 6:38 PM

#

husk

hoary mirage Dec 8, 2025, 6:38 PM

#

DONT HUSK

#

ITS PYTHON

native maple Dec 8, 2025, 6:39 PM

#

hold on ill make a fast python solution quickly

hoary mirage Dec 8, 2025, 6:39 PM

#

it will be slow

#

I can optimize it but too lazy

#

https://cdn.discordapp.com/attachments/889961998794752050/1447301823877611520/Sujithism_-_Video_by_sujithism.mp4?ex=6937c91c&is=6936779c&hm=744448ae1a900c0be0ad3242d2b844878224193f466dd33298041d9a93cee2c1&

▶ Play video

#

@native maple

native maple Dec 8, 2025, 6:54 PM

#

@hoary mirage

#

rewrote my elle solution into python

#

this is so funny

if step == 999:
    total[0] = math.prod(count for _, count in Counter(find(circuits, c) for c in range(len(circuits))).most_common(3))

hoary mirage Dec 8, 2025, 6:56 PM

#

native maple <@287555395151593473>

I WOULD BEAT YOU BUT

#

rosie explodeeew

lusty atlas Dec 8, 2025, 7:05 PM

#

guhhh i hate when i get wrong for input but not example

#

what edge cases does it have

hoary mirage Dec 8, 2025, 7:06 PM

#

hoary mirage The next two junction boxes are 431,825,988 and 425,690,689. Because these two j...

checl this

lusty atlas Dec 8, 2025, 7:07 PM

#

nop did

hoary mirage Dec 8, 2025, 7:12 PM

#

https://youtu.be/u0mVnuUh46w @lusty atlas

YouTube

C++ Weekly With Jason Turner

C++ Weekly - Ep 510 - The AMAZING Performance of array (and span)!

☟☟ Awesome T-Shirts! Sponsors! Books! ☟☟

Episode details: https://github.com/lefticus/cpp_weekly/issues/505

T-SHIRTS AVAILABLE!

► The best C++ T-Shirts anywhere! https://jason-turner-shop.fourthwall.com/

WANT MORE JASON?

► My Training Classes: http://emptycrate.com/training.html
► Follow me on twitter: https://twitter.com/lef...

▶ Play video

lusty atlas Dec 8, 2025, 7:16 PM

#

my solution is correct i am just running into crystal weirdness

#

ohhhhhhhhh

#

god how did i not think of this

lusty atlas Dec 8, 2025, 7:29 PM

#

lusty atlas god how did i not think of this

|| I was using a Map of points to circuit pointers. Then when two points are already different circuits, I just update one of the pointers to the other one's circuit. That worked but now the same circuit was made up of two pointers, so if that same circuit got changed again only some of the pointers got updated ||

native maple Dec 8, 2025, 7:49 PM

#

@robust yacht you never sent how fast my elle solution is with fixed arena

hoary mirage Dec 8, 2025, 7:51 PM

#

lusty atlas my solution is correct i am just running into crystal weirdness

Blaming the language instead of skills

#

I would like to tell all my connections I ate yogurt

lusty atlas Dec 8, 2025, 7:56 PM

#

i cleaned up my p1 and lol i only took 20 seconds to add p2

verbal parrot Dec 8, 2025, 7:57 PM

#

how fast

#

is ur

#

solution

#

why am i

#

typing like that

native maple Dec 8, 2025, 8:00 PM

#

verbal parrot how fast

100ms

verbal parrot Dec 8, 2025, 8:03 PM

#

okay mine is not that bad

native maple Dec 8, 2025, 8:04 PM

#

so far on track to get all solutions running in under 1s cumulatively

#

im at 300ms/1s

#

only 4 days left

verbal parrot Dec 8, 2025, 8:04 PM

#

i guess i can make mine faster by using bubble sort. or even better using that data structure queue set something something

native maple Dec 8, 2025, 8:05 PM

#

whats ur solution in

verbal parrot Dec 8, 2025, 8:05 PM

#

go

native maple Dec 8, 2025, 8:05 PM

#

verbal parrot i guess i can make mine faster by using bubble sort. or even better using that d...

min heap? priority queue?

native maple Dec 8, 2025, 8:06 PM

#

verbal parrot i guess i can make mine faster by using bubble sort. or even better using that d...

import "sort"

verbal parrot Dec 8, 2025, 8:06 PM

#

native maple min heap? priority queue?

uh lemme find

verbal parrot Dec 8, 2025, 8:06 PM

#

native maple import "sort"

i use sort.Slice but im not sure if its bubble sort

native maple Dec 8, 2025, 8:06 PM

#

verbal parrot i use sort.Slice but im not sure if its bubble sort

there is no way it is bubble sort

#

there are just better sorts in general

verbal parrot Dec 8, 2025, 8:07 PM

#

oh?

#

i only know bubble sort

native maple Dec 8, 2025, 8:07 PM

#

it likely switches between insertion sort and quicksort depending on the size of the array

lusty atlas Dec 8, 2025, 8:07 PM

#

native maple Dec 8, 2025, 8:07 PM

#

native maple Dec 8, 2025, 8:07 PM

#

lusty atlas

MY SOLUTION BEATS YOURS for once

#

i think

#

https://github.com/acquitelol/aoc2025/blob/mistress/solutions/08/solution.le

#

test :3

verbal parrot Dec 8, 2025, 8:08 PM

#

i hope tomorrow will be easier 😅

lusty atlas Dec 8, 2025, 8:08 PM

#

I initially had a smarter solution but i decided it's too complicated so I just switched to using one single 2d array and always finding index

native maple Dec 8, 2025, 8:08 PM

#

verbal parrot i use sort.Slice but im not sure if its bubble sort

verbal parrot Dec 8, 2025, 8:08 PM

#

yeah i saw

lusty atlas Dec 8, 2025, 8:09 PM

#

――――――――――――――――――――[solution.le:23:14]――――――――――――――――――――
Identifier 'MinHeap' isn't a struct or primitive type.
Are you sure you spelt 'MinHeap' correctly?

23 | dists := MinHeap::new<(f32, u64, u64)>(fn(a, b) #cast(i64, a.x - b.x));
^~~~~~~

#

guhhh do i have to upgrade elle again

native maple Dec 8, 2025, 8:09 PM

#

yes

lusty atlas Dec 8, 2025, 8:09 PM

#

bloat

#

❯ ellec solution.le --nogc
ERROR: qbe:./.build-solution/target.ssa:4878: identifier too long

Compilation of 'solution.le' finished with errors. (っ◞‸◟ c)

#

peak

native maple Dec 8, 2025, 8:09 PM

#

you can just git pull && make install-std install-runtime to update the stdlib

native maple Dec 8, 2025, 8:09 PM

#

lusty atlas ❯ ellec solution.le --nogc ERROR: qbe:./.build-solution/target.ssa:4878: identif...

yeah zoot had this I HATE QBE

hoary mirage Dec 8, 2025, 8:10 PM

#

add elle to fedora repos

#

so ven dont need to bother

verbal parrot Dec 8, 2025, 8:10 PM

#

add to HOMEBREW

hoary mirage Dec 8, 2025, 8:10 PM

#

elle to winget

native maple Dec 8, 2025, 8:10 PM

#

vee if you have qbe cloned locally you can just like, double NString to 160 in all.h and rebuild

verbal parrot Dec 8, 2025, 8:10 PM

#

play market? 😅

#

google play*

native maple Dec 8, 2025, 8:11 PM

#

im gonna start shipping a qbe fork along with elle soon

#

that way i can build qbe side by side and install both at once

vestal owl Dec 8, 2025, 8:11 PM

#

cloud iron https://www.rxddit.com/r/adventofcode/comments/1phiks9

???

lusty atlas Dec 8, 2025, 8:12 PM

#

lusty atlas I initially had a smarter solution but i decided it's too complicated so I just ...

my initial solution was kind of overcomplicated so I remade it to be simpler

cloud iron Dec 8, 2025, 8:12 PM

#

vestal owl ???

This seems way too easy

lusty atlas Dec 8, 2025, 8:12 PM

#

https://github.com/Vendicated/AdventOfCode/blob/main/2025/day8/solution.cr

vestal owl Dec 8, 2025, 8:12 PM

#

vestal owl ???

a functional programmer would spend 3 whole hours explaining this

vestal owl Dec 8, 2025, 8:12 PM

#

cloud iron This seems way too easy

ikr

lusty atlas Dec 8, 2025, 8:12 PM

#

lusty atlas <https://github.com/Vendicated/AdventOfCode/blob/main/2025/day8/solution.cr>

almost

hoary mirage Dec 8, 2025, 8:13 PM

#

stop using clash royale language

native maple Dec 8, 2025, 8:13 PM

#

crystal nesting so unreadable

lusty atlas Dec 8, 2025, 8:13 PM

#

because it uses 2 spaces?

#

yeah i hate it but idc enough to bother to change it

native maple Dec 8, 2025, 8:16 PM

#

native maple MY SOLUTION BEATS YOURS for once

on my machine

lusty atlas Dec 8, 2025, 8:16 PM

#

native maple crystal nesting so unreadable

do you use a smarter method than this

#

i tried switching to set but same perf

native maple Dec 8, 2025, 8:17 PM

#

lusty atlas do you use a smarter method than this

yes

#

you can actually stop early when the distance gets far enough away from the best distance

lusty atlas Dec 8, 2025, 8:18 PM

#

wdym?

native maple Dec 8, 2025, 8:18 PM

#

consider

#

i use length_sq so i have bdist * 400 but it would be bdist * 20 if you used just euclidean distance

lusty atlas Dec 8, 2025, 8:19 PM

#

no idea what u just said

native maple Dec 8, 2025, 8:19 PM

#

i guess try implement this

if dist < bdist { bdist = dist; }
else if dist > bdist * 400 { continue; }
``` and see if its faster

#

i also use a min heap instead of a normal array with sort at the end, its like 12ms faster for me

lusty atlas Dec 8, 2025, 8:20 PM

#

wtf is bdist

native maple Dec 8, 2025, 8:20 PM

#

its inf by default

#

uhh but change it to bdist * 20 since youre calculating the distance not distance squared

lusty atlas Dec 8, 2025, 8:21 PM

#

wtf is bdist 😭

native maple Dec 8, 2025, 8:22 PM

#

best distance holds the smallest square distance between 2 boxes

#

so if you calculate the distance between the boxes and theyre really far away (relative to the best distance) you can discard that pair early

robust yacht Dec 8, 2025, 8:24 PM

#

@native maple hii

lusty atlas Dec 8, 2025, 8:24 PM

#

native maple so if you calculate the distance between the boxes and theyre really far away (r...

the far away ones shouldn't matter because I break before they get checked

native maple Dec 8, 2025, 8:25 PM

#

they do for the sorting tho

lusty atlas Dec 8, 2025, 8:28 PM

#

😭

#

but this feels like cheating

native maple Dec 8, 2025, 8:29 PM

#

does pruning it really make it that much faster

lusty atlas Dec 8, 2025, 8:29 PM

#

yes

native maple Dec 8, 2025, 8:29 PM

#

lmao

lusty atlas Dec 8, 2025, 8:29 PM

#

why is the sort so slow wtf

lusty atlas Dec 8, 2025, 8:34 PM

#

lusty atlas why is the sort so slow wtf

oh because it has 499 500 elements LOL

#

with pruning it has 30293

lusty atlas Dec 8, 2025, 8:35 PM

#

native maple uhh but change it to `bdist * 20` since youre calculating the distance not dista...

did u pick this number by random or is there some logic behind it

native maple Dec 8, 2025, 8:36 PM

#

went up until my solution was still correct

lusty atlas Dec 8, 2025, 8:36 PM

#

yeah so literal cheating like i said 😭

#

thanks i hate it

native maple Dec 8, 2025, 8:36 PM

#

lusty atlas yeah so literal cheating like i said 😭

isnt it great

robust yacht Dec 8, 2025, 8:39 PM

#

no

lusty atlas Dec 8, 2025, 8:42 PM

#

oh i got sub 100ms without pruning

#

#

turns out sort_by is the same as .map().sort()

robust yacht Dec 8, 2025, 8:44 PM

#

sleepy veepy

lusty atlas Dec 8, 2025, 8:47 PM

#

lusty atlas turns out sort_by is the same as .map().sort()

so dumb

#

#

hmm ig there isn't a better way because you need to call the block multiple times otherwise

lusty atlas Dec 8, 2025, 8:52 PM

#

lusty atlas

oh god this is O(2n) + sort

#

even worse

robust yacht Dec 8, 2025, 9:37 PM

#

im never gonna get d8p1

#

ugh

#

nonstop interruptions messing up my focus

#

fuebfb

lusty atlas Dec 8, 2025, 9:45 PM

#

@robust yacht

frigid socket Dec 8, 2025, 9:45 PM

#

d8p1 looking so difficult

#

vai if 1000 points and I need to calculate the distance between every possible combination how many combinations

#

1000*1000

spring lionBOT Dec 8, 2025, 9:46 PM

#

frigid socket vai if 1000 points and I need to calculate the distance between every possible c...

To calculate the distance between every possible combination of 1000 points, you would have 499,500 combinations. This is calculated using the formula for combinations "n choose k", which in this case is 1000 choose 2 (1000 * 999 / 2).

-# Response generated by gemini-2.5-flash. AI may be incorrect or misleading.

lusty atlas Dec 8, 2025, 9:46 PM

#

the answer is 500k combinations

lusty atlas Dec 8, 2025, 9:46 PM

#

lusty atlas oh because it has 499 500 elements LOL

blobcatcozy

frigid socket Dec 8, 2025, 9:47 PM

#

so such a solution will inevitably take ages to resolve

#

and i can’t use typescript

robust yacht Dec 8, 2025, 9:51 PM

#

@frigid socket explain d8 to me

verbal parrot Dec 8, 2025, 9:52 PM

#

frigid socket vai if 1000 points and I need to calculate the distance between every possible c...

BRO WAS SKIPPING MATH CLASSES 💀💀💀💀

robust yacht Dec 8, 2025, 9:57 PM

#

faint insane

urban ginkgoBOT Dec 8, 2025, 10:00 PM

#

@frigid socket, <t:1765196970:R>: …

frigid socket Dec 8, 2025, 10:02 PM

#

verbal parrot BRO WAS SKIPPING MATH CLASSES 💀💀💀💀

okay help me

#

if you’re so smart

#

faint btw

#

@verbal parrot ?

#

or @native maple

#

i have absolutely no idea on how to write a sane solution

feral valve Dec 8, 2025, 10:26 PM

#

guh i've got a bug i cant find

feral valve Dec 8, 2025, 10:42 PM

#

my solution is like 200 lines husk

#

and also OCaml doesnt have built in Hashsets

#

ts pmo

verbal parrot Dec 8, 2025, 10:52 PM

#

frigid socket okay help me

Sure! What are your thoughts on this puzzle

#

Any ideas?

frigid socket Dec 8, 2025, 10:52 PM

#

faint im serious

#

i cannot figure it out for the life of me'

feral valve Dec 8, 2025, 10:54 PM

#

this is just like ugly, i dont enjoy writing code like this

lusty atlas Dec 8, 2025, 11:00 PM

#

frigid socket i cannot figure it out for the life of me'

where are you stuck

#

create an array containing all possible 500k pairs. sort them by their distance

then loop over it

frigid socket Dec 8, 2025, 11:02 PM

#

so there is no other way than making 500k pairs

#

😭

#

This will be so slow

verbal parrot Dec 8, 2025, 11:03 PM

#

frigid socket faint im serious

remind me in an hour im Gaming

frigid socket Dec 8, 2025, 11:05 PM

#

@lusty atlas did you just give up on crystal lsp

#

going so insane

lusty atlas Dec 8, 2025, 11:05 PM

#

wdym

lusty atlas Dec 8, 2025, 11:05 PM

#

frigid socket This will be so slow

it's fine

#

you only have to check the first 10k pairs or so

#

the slowest part is sorting the 500k element array

#

crystal does it in 80ms

#

you can cheat by discarding any pairs whose distance is 20x bigger than the smallest distance

#

still correct solution

lusty atlas Dec 8, 2025, 11:09 PM

#

feral valve this is just like ugly, i dont enjoy writing code like this

why not, it's clean

#

basically same i wrote

#

but mine is shorter

feral valve Dec 8, 2025, 11:10 PM

#

I rewrote it into a union find

#

every aoc i learn about new data structures

pale stirrup Dec 8, 2025, 11:10 PM

#

only one you need to know is 2d matrix

#

they love them

lusty atlas Dec 8, 2025, 11:11 PM

#

tf is Array.blit

pale stirrup Dec 8, 2025, 11:12 PM

#

lc.g crystal Array.blit

prime sphinxBOT Dec 8, 2025, 11:12 PM

#

pale stirrup lc.g crystal Array.blit

-# <:i:1263593669215256597> labsCore will be shutting down <t:1767265200:R> • Learn more

stackoverflow.com

python - How to create a pygame surface from a numpy array of ...

Dec 15, 2016 ... crystal-reports; swagger; namespaces; android-emulator; aggregation ... blit(surf, (0, 0)) and pygame.display.update() in front of the loop.

pale stirrup Dec 8, 2025, 11:13 PM

#

is it a custom function or something

lusty atlas Dec 8, 2025, 11:13 PM

#

that is not crystal

#

bro is using some functional language

pale stirrup Dec 8, 2025, 11:13 PM

#

made a false assumption ig

lusty atlas Dec 8, 2025, 11:14 PM

#

ocaml

#advent of code 2025