I have one problem where slowest AC is 0.94, and time multiplier is 1.5.
Verifyproblem (and presumably Kattis as well) does the calculation as follows:
round(0.94 * 1.5 + 0.5) => 1s
(See https://github.com/Kattis/problemtools/blob/develop/problemtools/verifyproblem.py#L1400).
giving a 1s time limit. This is much too close to the slowest AC. I propose the actual
algorithm should be:
ceil(0.94 * 1.5) => 2s
This would have the effect of adding an everage of 0.5s to all time limits, but it would
resolve this important corner case.