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 1218. Episode N-th: The Jedi Tournament

Why TL#4???
Posted by Neizvestnii 13 Aug 2007 09:47
I shocked! My program used 2 dfs(for find conecting components). Thats all. n<=200. Dfs work by O(n+m).
Why I have TL???
Please help me, I really dont understand, where my mistakes.
Re: Why TL#4???
Posted by Neizvestnii 13 Aug 2007 22:12
If you had TL#4 then increase your massivs.
Because, if you use graf, then quantity of edges may 40000
Re: Why TL#4???
Posted by Neizvestnii 14 Aug 2007 11:50
What should we search? Components of strong connectivity or cycles?
Please help me...
Please help me...
Posted by Neizvestnii 15 Aug 2007 09:03
If I search for components of strong connectivity that I receive WA#4. When I search for cycles I receive WA#5. What should I search?
Please help me.
I stupid....
Posted by Neizvestnii 15 Aug 2007 18:13
I got AC!!!