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 1208. Legendary Teams Contest

TLE#6
Posted by jagatsastry 4 Dec 2007 21:43
Is there anyone who made some optimization after having got TLE#6.
I used a direct recursive technique, first building an adjacency matrix taking each team as a node and common players as an edge. Then found the no of unconnected components of the graph.
Any better method?