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)))$$$. 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 :(.