Religious People

#1

Can you help me optimizing my approach?

#2

are u willing to explain what are u trying to do in the question

#3

I calculated no of a nodes of each connected graph and analayzing the problem i devised a formula:
Cost+=min(cost of temple+no of vertices-1(no of min edges),cost of temple*no of vertices)

#4

I calculate no of nodes of one connected graph using dfs by taking counter c as global variable

#5

The only problem is my approach is giving tle passing only one test case

#6

u mean to say
cost of temple + ( no of component in that connected component-1) * cost of road

#7

yes i wanted to say this

#8

please refer this

i am trying to debug you code as well