Discussion @ 2039. Striped Square @ Timus Online Judge

It seems that TL is ridiculously strict.

Posted by MVM 29 Mar 2015 19:49

Is it because O(nm log (n + m)) solutions are not supposed to pass or something like that?
My solution has relatively high constant, but O(nm(n + m)) or O(nm log^2 (n + m)) solutions probably won't pass even if TL was bigger, I think.

Edited by author 29.03.2015 20:20

Re: It seems that TL is ridiculously strict.

Posted by Qantas [SESC 17] 18 Jan 2016 16:56

No comments.

Re: It seems that TL is ridiculously strict.

Posted by Shen Yang 13 Mar 2017 19:12

usigned int +hash get Accept

Discussion of Problem 2039. Striped Square