-
Notifications
You must be signed in to change notification settings - Fork 0
/
Trees-Balanced Forest.py
44 lines (30 loc) · 964 Bytes
/
Trees-Balanced Forest.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#Problem Link : https://www.hackerrank.com/challenges/balanced-forest/problem?isFullScreen=true&h_l=interview&playlist_slugs%5B%5D=interview-preparation-kit&playlist_slugs%5B%5D=trees
#Ans:
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'balancedForest' function below.
#
# The function is expected to return an INTEGER.
# The function accepts following parameters:
# 1. INTEGER_ARRAY c
# 2. 2D_INTEGER_ARRAY edges
#
def balancedForest(c, edges):
# Write your code here
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
q = int(input().strip())
for q_itr in range(q):
n = int(input().strip())
c = list(map(int, input().rstrip().split()))
edges = []
for _ in range(n - 1):
edges.append(list(map(int, input().rstrip().split())))
result = balancedForest(c, edges)
fptr.write(str(result) + '\n')
fptr.close()