PAT 1034 Head of a Gang[难]

1034 Head of a Gang (30)（30 分）

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 threshold, 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

题目大意：给出一个阈值k，一个帮派的定义是人数大于2，必须是3人或者3人以上，并且总的通话时长要>k，=k不可以，满足这两个条件，就可以被称为一个帮派，在一个帮派内部，需要找出累计通话时长最多的人，那个人就是头，并且输出帮派内总人数。

//根普通的不一样的就是，现在图的下标不是用数字来表示了，而是用字母。

//虽然说可以用并查集，但是在一个数组里也不好遍历。set也不好用，除非结构体里设置很多属性，但是这样维护起来不好维护。好麻烦啊这道题。看似简单。

原文地址：https://www.cnblogs.com/BlueBlueSea/p/9457604.html