并查集模拟_1034 Head of a Gang （30 分）

原创

于 2018-11-25 09:42:16 发布 · 976 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#并查集 #map #pair #c #PAT

该博客介绍了一个利用并查集解决编程竞赛题目的案例，题目要求找出电话联系时间超过特定阈值K并且人数超过2的团伙，输出团伙首领及其成员数量。通过并查集实现离线操作，确保联系时间最长的人作为团伙首领。文章讨论了样例分析和程序实现细节。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1034 Head of a Gang （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 threthold 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 forma