Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 04f07ae

Browse files
Merge pull request #3 from Kashyap85/master
Graph and Theory solution for HackerRank
2 parents 7308f20 + 325f12d commit 04f07ae

File tree

1 file changed

+23
-0
lines changed

1 file changed

+23
-0
lines changed

‎roads and libraries.py

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
from collections import defaultdict
2+
def roadsAndLibraries(n, c_lib, c_road, cities):
3+
def dfs(i):
4+
vset.add(i)
5+
ans=1
6+
if i in d:
7+
for j in d[i]:
8+
if j not in vset:
9+
ans+=dfs(j)
10+
return ans
11+
12+
if c_road>c_lib:
13+
return c_lib*n
14+
vset=set()
15+
d=defaultdict(list)
16+
for u,v in cities:
17+
d[u].append(v)
18+
d[v].append(u)
19+
group=[]
20+
for i in range(1,n+1):
21+
if i not in vset:
22+
group.append(dfs(i))
23+
return n*c_road+(c_lib-c_road)*len(group)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /