weak test cases in TOWFL???

i haven’t solved the TWOFL problem, but i have read an accepted code from one other, and i found that his code can’t pass the my test case (TLE). I generated the input for my test case by the following code
(you can change the variable n,m higher than 200 as i set)

i tested 3 submissions got 100 points:
in Codeforces by “Custom Invocation” and all of them got TLE with my test case
i realize that the time complexity of the first out of 3 submission above can goes up to (n.m)^2

By the way, where is the editorial for June Challenge 2018?

1 Like