Hello Codeforces! Today was the National team selection contest in Syria. There was a problem with a solution that time complexity of $$$O(nmlog(max(n,m)))$$$ and a time limit of 5s. But Unfortunately, my solution with the same time complexity didn't pass due to a bit worse constant. So I have a question to all experienced problemsetters and contest organizers. If you had a similar problem with tight constraints ($$$n \leq 4000 , m \leq 4000$$$) and an old gnu c++ 11 on the server what would you choose the time limit to be? Thank You in advance! I am not insulting anyone with this blog I am just so frustrated and I am curious to learn more about the problemsetting process :(. Note that the original memory limit was also tight it was 256 MB :). Edit: I deleted the problem for a special reason. But I think my complaint is clear now.

Edit2: I have found that the solution that had $$$O(nmlog(max(n,m)))$$$ can be done in $$$O(nm)$$$ in a surprisingly easier way so the real mistake comes from not testing the contest well. :) Also I think that is_this_fft's comment gives a much reasonable approach for determining the Time Limit in future contests. Thank you all! Hope this doesn't happen again.