NotAwfulTech

385 readers

6 users here now

a community for posting cool tech news you don’t want to sneer at

non-awfulness of tech is not required or else we wouldn’t have any posts

founded 1 year ago

MODERATORS

self@awful.systems

Advent of Code 2024 Week 2: this time it's all grids, all the time (awful.systems)

submitted 1 week ago by gerikson@awful.systems to c/notawfultech@awful.systems

24 comments fedilink hide all child comments

The previous thread has fallen off the front page, feel free to use this for discussions on current problems

Rules: no spoilers, use the handy dandy spoiler preset to mark discussions as spoilers

you are viewing a single comment's thread
view the rest of the comments

[–] swlabr@awful.systems 3 points 1 week ago (5 children)

Day 11!

discussion p1 + 2

I'd say this was pretty easy. My instinct was that 64 bit ints were big enough for this problem, and that memoising would also be a good idea. I didn't experiment with a control though, so I don't know if memoisation was truly necessary. Either way, my initial solution for 1. was performant enough for part 2.

[–] swlabr@awful.systems 2 points 1 week ago* (last edited 1 week ago) (1 children)

followup

So memoisation is predictably needed for part 2 to run in time. It's an O(e^n^), so it takes seconds by step 39 and minutes by step 47.

[–] zogwarg@awful.systems 3 points 1 week ago* (last edited 1 week ago) (1 children)

re:followup

If you somehow wanted your whole final array it would also require over 1 Peta byte ^^, memoization definetely reccomended.

[–] swlabr@awful.systems 4 points 1 week ago

spoiler

It's one AOC problem zogwarg, what could it cost? 10 PB?

load more comments (3 replies)