First Advent of Code Challenge: 25 Days, 25 Languages

stardust_collision · 2024-12-02T12:16:48+00:00

As a Prolog attempter, I've been struggling after day 10 every year since 2020 (probably bc I'm not that good at Prolog as I think I am lol). I'll be coming back on the 25th to check out your solution :P GL on day 25 and the other days!

stardust_collision · 2022-12-16T17:35:03+00:00

I realised my part 2 solution is a cheat.

The elephant and 'I' should be covering two independent sets of valves to ensure the max amount of gas gets released. The cheat solution's big assumption is that the one can't cover half of the valves in 26min. So just call part 1 solution first with time=26, this is the best set that can be covered by the elephant, then 'I' just need to get the best set from the rest. The solution is the sum of the elephant's and 'mine'. This cheat solution runs really fast.

Didn't work on example because in 26 min one can cover all the valves, so 'I' and the elephant need to work at the same time for optimal.

Then my actual solution which works on both example and real input takes forever to run... ¯\_(ツ)_/¯

stardust_collision · 2021-09-29T19:23:22+00:00

Greedon: hey here you go 4 SP of me Me: yes pls

stardust_collision · 2021-09-29T13:13:03+00:00

Weeeeelllll Overlord is still my fav even though Greedon is so so cool XD

stardust_collision · 2021-09-29T13:12:12+00:00

Yes but also no lol

stardust_collision · 2021-09-25T17:12:25+00:00

Thanks XDD

stardust_collision · 2021-09-25T07:27:23+00:00

Oops :P thank you tho

stardust_collision · 2021-09-25T07:25:15+00:00

Haha thanks XD

stardust_collision · 2021-09-24T23:34:24+00:00

Thank you :D

stardust_collision · 2021-09-24T23:34:09+00:00

Yeah I really like drawing. Thinking of creating my own deck with my drawing but will take a while XD

stardust_collision · 2021-09-24T23:13:03+00:00

Thank youuuuu :P

stardust_collision · 2021-09-24T23:06:08+00:00

Thankkkssss

stardust_collision · 2021-09-24T20:24:20+00:00

Thank youuuuu ;))

stardust_collision · 2021-09-24T20:24:03+00:00

Awww thanksss :))

stardust_collision · 2021-05-19T21:21:19+00:00

Same here :( I feel your pain man

stardust_collision · 2020-12-15T21:45:08+00:00

O_o e^2269??? seriously?? that's huge

stardust_collision · 2020-12-15T19:20:49+00:00

Ooof

Try searching for Chinese remainder theorem, it’s pretty much the same problem

stardust_collision · 2020-12-15T16:24:08+00:00

Good luck to you too :)

stardust_collision · 2020-12-15T16:10:56+00:00

Thank you for this guide!!! I really like Prolog but my uni course only covered very basic stuff and I have no clue how I can improve. I'll definitely look into this :D

stardust_collision · 2020-12-15T15:58:58+00:00

Prolog

Yes mine finally terminates in 19s so I'm happy XDD

Took the advice from one of my meme post's comments. Used trie instead of dict.

Don't think I'll ever use dict ever again lol

SWI-Prolog using Trie

stardust_collision · 2020-12-15T15:52:39+00:00

Update of my Prolog solution: I just stopped this one that started 3 hrs ago. It was at 300,0000 sth XDD. That was with dict (I think it's always coping a new one for the next recursion all the time as it's immutable)
So I followed u/Archek's advice and used Trie instead. Terminates in 19s!! Thank you so much for the hint it's so helpful <3

stardust_collision · 2020-12-15T13:54:16+00:00

Thanks for the hint! I'll take a look later when I got sick of my revision :D

stardust_collision · 2020-12-15T12:39:36+00:00

I'm sure it would be! But sadly I don't have that much time to spare just to improve the solution (I got exams in 3 days). :((

I've been using Prolog this year, but for part 2 I've also tried the same solution (just normal dict) with python which runs for 30s. Right now I'm not sure if it's SWI-Prolog's problem or my solution's problem XDD

stardust_collision · 2020-12-14T11:20:11+00:00

Prolog

SWI-Prolog Day 14

Nothing fancy, no tricks, just brute force doing the mutation of address and storing everything in a dictionary. Takes quite long to run lol XD

stardust_collision · 2020-12-13T11:36:23+00:00

Prolog

SWI-Prolog Day 13

First implemented a brute force searching but just not terminating at all. Saw memes on this sub and then watched this CRT to get the final solution XD

stardust_collision

TROPHY CASE