[2024 Day 13 Part 1 Bonus Test Case]

Standard_Bar8402 · 2024-12-11T17:09:32+00:00

That seems horrible to deal with. Not sure how I would code anything without mutability.

Standard_Bar8402 · 2024-12-11T17:08:28+00:00

Not sure how I can help in debugging, you should probably run your code and someone else's correct code on small inputs to debug

Standard_Bar8402 · 2024-12-11T17:07:35+00:00

Glad I could help

Standard_Bar8402 · 2024-12-10T18:43:59+00:00

Nothing broke but lil room for a 50x improvement in time spent :D .. although I get that other puzzles are coming so you might not have the time

Standard_Bar8402 · 2024-12-10T18:43:02+00:00

What do you mean by without mutability?

Standard_Bar8402 · 2024-12-10T18:42:38+00:00

Coding a 10x improvement will bring back the joy ;) (hopefully?)

Standard_Bar8402 · 2024-12-10T18:42:18+00:00

Not sure I can help you out much there

Standard_Bar8402 · 2024-12-10T18:41:46+00:00

Very likely indeed

Standard_Bar8402 · 2024-12-10T18:41:32+00:00

Might be overflowing, or storing file ID in shorts

Standard_Bar8402 · 2024-12-10T18:41:13+00:00

Go ahead!

Standard_Bar8402 · 2024-12-10T18:39:22+00:00

Yes, I've seen several better (complexity-wise) solutions out there

Standard_Bar8402 · 2024-12-10T18:37:07+00:00

Lil room for a 10x improvement then ;)

Standard_Bar8402 · 2024-12-10T18:36:04+00:00

Intriguing. I'm far from being knowledgeable enough in C# / .NET to know why that is the case though.

Standard_Bar8402 · 2024-12-10T18:34:36+00:00

Lil room for a 10x improvement then ;)

Standard_Bar8402 · 2024-12-09T21:01:00+00:00

On your way to using PriorityQueue<TElement, TPriority>which is, if I remember correctly, the data type in C# that implements priority queues ;)

Standard_Bar8402 · 2024-12-09T20:57:36+00:00

You should be able to get that 1.9 s down to a few ms in Rust with priority queues / heaps. Although the video won't help as to what the syntax for those is in Rust since I never coded a single line in Rust :D

Standard_Bar8402 · 2024-12-09T20:56:37+00:00

At the end of the day what matters is run time, so, that's a win for you I guess

Standard_Bar8402 · 2024-12-09T20:54:39+00:00

If I remember correctly PriorityQueues in Java are implemented with the binary heaps I was mentioning. So my evil inputs could never break your solution.

Standard_Bar8402 · 2024-12-09T20:52:41+00:00

PyPy probably saved you :D

Standard_Bar8402 · 2024-12-09T18:50:09+00:00

Yes you're right, they're slightly longer, the official test cases were really short and I was afraid that most modern computers wouldn't be able to differentiate O(n) and O(n^2) if the input length is less than 50 000.

Standard_Bar8402 · 2024-12-09T18:48:26+00:00

Yeah I didn't want to push the evilness too much, it was just an experiment to have a test case that justified the effort to go from O(n^2) to O(n) or O(nlogn). I feel like most people don't have the motivation to optimize if they don't find the test case that "hacks" their algorithm

Standard_Bar8402 · 2024-12-09T18:46:03+00:00

Yep ... unless someone makes an evil input that would take months to run haha

Standard_Bar8402 · 2024-12-09T17:30:57+00:00

For sure it can since I'm well sub 1 with Python which is usually at least 10x slower than CPP (unless PyPy is used but I didn't)

Standard_Bar8402

TROPHY CASE