|
|
back to boardTLE#6 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? |
|
|