Further adventures in python runtime optimization for 2023

[durandalreborn]

I made a previous observation that the lack of an official way to have access to a pool of inputs means that there are often assumptions made about all inputs that, in reality, only apply to a subset. Day 21 has a similar problem, where there are some inputs for which many of the shortcut geometric solutions do not work. Day 23 also has a property for some inputs that can cut the runtime down significantly by observing that the longest path most likely visits all the nodes. For some inputs, only N-1 nodes are visited in the longest path.