ENG
RUS
Timus 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
Discussion of Problem
2039
. Striped Square
Show all threads
Hide all threads
Show all messages
Hide all messages
It seems that TL is ridiculously strict.
MVM
2039
. Striped Square
13 Mar 2017 19:12
3
It seems that TL is ridiculously strict.
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.
Qantas [SESC 17]
18 Jan 2016 16:56
No comments.
Re: It seems that TL is ridiculously strict.
Shen Yang
13 Mar 2017 19:12
usigned int +hash get Accept
New topic
Style:
flat
|
tree
|
nested
Thread Order:
bubble
|
fixed
© 2000–2024
Timus Online Judge Team
. All rights reserved.