Religious temple

#1

what mistake i done??

#2

your code fails for several testcases like
1
4 2 2 1
1 3
3 2
Expected Output :
6 (two temples and two road, 4 is isolated)

Here’s some hint as to how to approach the problem :
Count the number of disjoint components (subgraphs which are not connected to each other) and store them in a variable , say ‘components’
Each component must have a single Temple
So cost of temple in each component is a components
Further there are (x-1) roads required in each component where x is no of vertices in that component
Sum of roads in all components = (n - components) , n is no of nodes in adjacency list
Multiply that with b , cost to repair each road
Cost so far , cost = a component + b*(n-component)

But there are some vertices that do not form any edges
Some vertices which stand alone and each of these vertices must have a temple of its own
Since they do not form any edge , there count is not included in the adjacency list
No of such nodes is (V - n) …where V is total no of nodes and n is no of nodes that form an edge and are part of previously counted components
Since each of these nodes must have a temple
Total cost = a component + b (n-component) + a*(V-n)

Do not forget to consider the base case when a<=b

#3

How is b×(n-conpoment came??

#4

Can you clear?? …

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.