题目:
One way that the police finds the head of a gang is to check people’s phone calls. If there is a phone call between A and B, we say that A and B is related. The weight of a relation is defined to be the total time length of all the phone calls made between the two persons. A “Gang” is a cluster of more than 2 persons who are related to each other with total relation weight being greater than a given threshold K. In each gang, the one with maximum total weight is the head. Now given a list of phone calls, you are supposed to find the gangs and the heads.
Input Specification:
Each input file contains one test case. For each case, the first line contains two positive numbers N and K (both less than or equal to 1000), the number of phone calls and the weight threthold, respectively. Then N lines follow, each in the following format:
Name1 Name2 Time
where Name1 and Name2 are the names of people at the two ends of the call, and Time is the length of the call. A name is a string of three capital letters chosen from A-Z. A time length is a positive integer which is no more than 1000 minutes.
Output Specification:
For each test case, first print in a line the total number of gangs. Then for each gang, print in a line the name of the head and the total number of the members. It is guaranteed that the head is unique for each gang. The output must be sorted according to the alphabetical order of the names of the heads.
Sample Input 1:
8 59
AAA BBB 10
BBB AAA 20
AAA CCC 40
DDD EEE 5
EEE DDD 70
FFF GGG 30
GGG HHH 20
HHH FFF 10
Sample Output 1:
2
AAA 3
GGG 3
Sample Input 2:
8 70
AAA BBB 10
BBB AAA 20
AAA CCC 40
DDD EEE 5
EEE DDD 70
FFF GGG 30
GGG HHH 20
HHH FFF 10
Sample Output 2:
0
def find(x):
while (father[x] != x):
x = father[x]
return x
def union(x, y):
a = find(x)
b = find(y)
if (a <= b):
father[b] = a
else:
father[a] = b
line = input().split(" ")
n = int(line[0]) # 电话的次数
cmax = int(line[1])
time = {}
father = {}
for i in range(n): # 根据每一通电话,记录每两个人的关系和每个人的通话时间
line = input().split(" ")
x, y, z = line[0], line[1], int(line[2]) # x,y分别代表打电话的两个人,z代表他们两个人的通话时间
if x not in time:
time[x] = 0
if y not in time:
time[y] = 0
time[x] += z
time[y] += z
if x not in father:
father[x] = x
if y not in father:
father[y] = y
union(x, y)
couple = {}
time['DDDD'] = 0 # 用于每一个组织的暂时队首。为了方便后期比较
for key, value in father.items():
x = find(key)
if x not in couple:
couple[x] = [0,0,'DDDD'] # [总的通话时间,人数,队首]
couple[x][0] += time[key] # 当前组织的总通话时间加上当前这个人的通话时间
couple[x][1] += 1 # 当前组织的总人数+1
if time[key] >= time[couple[x][2]]: # 如果当前这个人的通话时间大于当前队首的通话之间,那么他成为队首
couple[x][2] = key
for key in list(couple.keys()):
if couple[key][0] <= 2*cmax:
del couple[key]
elif couple[key][1] <= 2:
del couple[key]
x = sorted(couple.items(), key=lambda x: (x[1][2]))
print(len(x))
for i in x:
print(i[1][2], i[1][1])