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 1452. Pascal vs. C++

Complexity
Posted by Krayev Alexey (PSU) 24 Jul 2006 13:37
Which complexity is the best? I got ac with O(n^2*logn), but the running time of my program was 0.25s.
Re: Complexity
Posted by N.M.Hieu ( DHSP ) 24 Jul 2006 14:36
O(N^2) is the best I knew.
However, it takes N^2 in memory.
See Timus-1395 "Pascal vs C++. Version 2" (-)
Posted by Dmitry 'Diman_YES' Kovalioff 24 Jul 2006 17:01
Re: Complexity
Posted by TheBeet 14 Aug 2006 11:21
I got AC in 0.046s with O(n^2). But take O(n^2)memory