I am trying to solve [problem:611D], I wrote [submission:60357814] this solution. I think the Time Complexity of ↵
my solution is $O(n ^ 2\log{}n)$ but I am getting Time Limit Exceeded verdict. I want to know is my Time Complexity analysis is wrongor onlbecause I saw many $O(n ^ 2\log{}n)$ solution will passs are accepted(like [submission:15127310]) but not mine.↵
my solution is $O(n ^ 2\log{}n)$ but I am getting Time Limit Exceeded verdict. I want to know is my Time Complexity analysis is wrong
