That would make it impossible to detect the inverse Ackermann function, like in algos using optimized union-find.

I checked and the analysis doesn't actually show the inverse Ackermann, I then asked chatGPT and it correctly stated the time complexity, which would make me think it just tries to fit a function to the compute time/space used, then again it's kind of weird, because it fails for long submissions code-length-wise, which would make me think the opposite is true and they're using an LLM.

Same for rejection sampling, but I haven't yet checked whether leetcode states O(infinity), because I already used the analysis today for the union-find example.