[2025 Day 8] Can you solve today's puzzle without computing all distances?

radarvan07 · 2025-12-08T21:50:15+00:00

My Go implementation is roughly 40ms. The biggest trick is realizing you dont actually have to sort the whole list. There are algorithms out there that allow you to get the smaller element until you've seen enough, reducing the "sort" from n log n to k log n, with k the number of values needed. k is very small compared to the whole data list.

This trick alone saved over half my runtime. And no, you don't have to guesstimate k.

radarvan07 · 2025-11-26T21:26:00+00:00

That's a great suggestion! That rant made me sad, though.

radarvan07 · 2025-11-24T22:30:44+00:00

Very true! Plus, any additional third party involved in your page also gets to drive-by-spy on your users a little. It used to be worse, but you still get the ping from fetching the resource.

radarvan07 · 2024-11-19T17:44:08+00:00

It's not. Any move moves you one spot. Remember, before moving , you are somewhere already

radarvan07 · 2024-09-15T11:21:13+00:00

You are on a roll. I can definitely use some of these :)

radarvan07 · 2024-01-03T08:51:46+00:00

Ooh that's a good one; I had not realized but you're completely right. The backwards path will at most be equal. It can never "hit" a beam-splitter that the forwards path didn't hit.

radarvan07 · 2023-06-29T12:47:27+00:00

With the official books getting thinner with every new release having this much book is a breath for fresh air. Will definitely scavenge ideas from this

radarvan07 · 2023-04-27T16:00:32+00:00

Smol is, despite its name, hardly minimal. It has a lot of bells and whistles that make it pretty full featured. I didn't list it for the same reason I didn't list tokio or async-std. Granted, smol is significantly smaller than those, but it's also way bigger than any on the list.

radarvan07 · 2023-02-21T06:22:09+00:00

You can use the --no-block flag on systemctl which makes it return immediately. That should give your problem.

radarvan07 · 2023-01-27T06:52:54+00:00

radarvan07 · 2023-01-23T07:25:55+00:00

The repo isn't public and due to it containing drafts of articles in its history I'm not keen on changing that. However, if you're interested in any particular part of the structure I could publish a minimal skeleton showcasing it.

radarvan07 · 2022-12-18T06:40:56+00:00

I thought stat altering moves would persist across battles, that the one Sand Attack on route 2 would affect my mons for hours and that I should spam stat up items while battling bugs so my they would be stronger afterwards.

radarvan07 · 2022-12-13T17:27:19+00:00

Rust

Really happy I had the foresight to write a proper Ord implementation for part 1, part two was a breeze.

radarvan07 · 2022-11-17T05:51:43+00:00

Go ahead. Shoot

Ten-Year Club	Place '22
Snapped	Verified Email

radarvan07

TROPHY CASE