|
|
back to boardShow all messages Hide all messagesI passed for G (N ^ 2). Is this normal? What is the asymptotic behavior of a normal solution? Make program, which will find solution for test ><<<<<<<<...(29999 symbols '<'), and send it on timus. If it fails with WA1, then it's normal. If it fails with TL1, then it's weak testing. Sorry for bad english. Power of timus server not equal power of contest server. TL on thimus is not indicator. If you got TL then tests on this task should be harder and such solutions must fail. Better try test >>>...(15000 times)..>>><<<...(15000 times)..<<< If your solution passes it in time - then limitations of the problem are already too weak for modern computation facilities =( If it gets TL - then timus tests are just weak. Anyway, there exists correct O(N) algo... Where I can read about algorithm or idea? That's the main idea of the problem - not to read about an algorithm or idea but to turn your brains on and create it. This is possible (and even not difficult), try it! |
|
|