leetcode 1168. Optimize Water Distribution in a Village

There are n houses in a village. We want to supply water for all the houses by building wells and laying pipes.

For each house i, we can either build a well inside it directly with cost wells[i], or pipe in water from another well to it. The costs to lay pipes between houses are given by the array pipes, where each pipes[i] = [house1, house2, cost] represents the cost to connect house1 and house2 together using a pipe. Connections are bidirectional.

Find the minimum total cost to supply water to all houses.

 

Example 1:

Input: n = 3, wells = [1,2,2], pipes = [[1,2,1],[2,3,1]]
Output: 3
Explanation: 
The image shows the costs of connecting houses using pipes.
The best strategy is to build a well in the first house with cost 1 and connect the other houses to it with cost 2 so the total cost is 3.

 

Constraints:

• 1 <= n <= 10000
• wells.length == n
• 0 <= wells[i] <= 10^5
• 1 <= pipes.length <= 10000
• 1 <= pipes[i][0], pipes[i][1] <= n
• 0 <= pipes[i][2] <= 10^5
• pipes[i][0] != pipes[i][1]

class Solution {
public:
    int minCostToSupplyWater(int n, vector<int>& wells, vector<vector<int>>& pipes) 
    {
        root.resize(n + 1 , 0) ;
        int res = 0 ;
        
        for(int i = 1 ; i <= n ; i++)
        {
            root[i] = i ;
            pipes.push_back({0 , i , wells[i - 1]}) ;
        }
        
        sort(pipes.begin() , pipes.end() , [](vector<int>& a , vector<int>& b){return a[2] < b[2] ;}) ;
        
        for(auto pipe : pipes)
        {
            if(n <= 0) break ;
            int x = find(pipe[0]) , y = find(pipe[1]) ;
            if(x != y) 
            {
                res += pipe[2] ;
                root[x] = y ;
                n-- ;
            }
        }
        
        return res ;
    }
    
    
    int find(int x)
    {
        if(x != root[x]) return find(root[x]) ;
        else return x ;
    }
    
private :
    vector<int> root ;
};