Part 1 was indeed a directed acyclic graph so it is now solved in linear time. On the other hand, part 2 removed the slippery slopes so there may yet be a market for the QuantumBark™ accelerator. Needless to say the dog developer has become quite noisy in anticipation of a large windfall of dog treets.Oh no! Is part 1 of day 22 NP-complete?Compared to day 21 the program is quite speedy and the warmed up execution time is under the 15 second limit.
https://en.wikipedia.org/wiki/Longest_path_problem
Fido's tail has been wagging all afternoon about how the QuantumBark™ accelerator currently under development is well suited for solving NP-hard Advent of code puzzles. Apparently the quantum circuits can be programmed using QBasic in place of OpenQASM.
I couldn't help it and mumbled that QBasic ran just fine under MS-DOS. Fortunately, the dog developer wasn't paying attention.
Do the slippery slopes turn the forest paths into a directed acyclic graph?
I wonder if a GPU would be more practical.
Statistics: Posted by ejolson — Tue Feb 06, 2024 4:28 am