ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 2039. Striped Square

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
Qantas [SESC 17] Re: It seems that TL is ridiculously strict. [1] // Problem 2039. Striped Square 18 Jan 2016 16:56
No comments.
usigned int +hash get Accept