UVA - 11631 - Dark Roads

• ID : UVA - 11631 - Dark Roads
• Status : Accepted
• Type : Graph MST .
• Time : 30 Minutes to Submission.
• Language : Java
• Solution :
1. Add Total Costs of Edges.
2. Kruskal MST on Edges using Union-Find Algorithm
3. Subtract the MST cost from the Total cost.
• Problems :
1. Large Data Input so Buffered Reader & Scanner will give TLE
2. Don't Use Java Standard Input readers but use this Parser Instead.