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
读懂题之后就想用图的知识做，每个连通分支如果结点个数不超过2直接不考虑，所有边权值和不超过k也不考虑，搜索的过程中找到当前连通分支权值最大的点，给出的是字符串，可以hashing一个值，这个值不是连续的，再对应到连续的值1~c，题目中最多不超过2000 = 2 * 1000，然后就可以用mp记录边的值了，累加的，val记录点的值，也是累加的，这样一来，邻接矩阵就有了。。。然后进行搜多，vis标记访问，最后把答案排序。。。代码：#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <map>
using namespace std;
struct info {///记录答案 写成结构体方便排序 头 和 数量
int id,num;///id就是 head of a gang ， num是人数
info() {
id = num = 0;
}
}ans[2001];///记录答案
int n,k,c,d,pos[20000],mp[2001][2001],vis[2001],val[2001],ant,temp;///pos记录hashing值对应1~c的第几个值
char s1[4],s2[4],s[2001][4];
int getval(char *t) {///hashing值
return (t[0] - ‘A‘) * 26 * 26 + (t[1] - ‘A‘) * 26 + t[2] - ‘A‘;
}
void dfs(int p) {///搜索某个连通分支
vis[p] = 1;///标记
ans[ant].num ++;///人数加一
if(val[p] > val[ans[ant].id])ans[ant].id = p;///更新head
for(int i = 1;i <= c;i ++) {
if(!mp[p][i])continue;///无权边 即为 两人无关
if(p < i)temp += mp[p][i];///仅当p < i 就是按同一个方向 累加关系值 防止重复和漏加
if(vis[i] || !mp[p][i])continue;
dfs(i);
}
}
bool cmp(info a,info b) {
return strcmp(s[a.id],s[b.id]) < 0;
}
int main() {
scanf("%d%d",&n,&k);
for(int i = 0;i < n;i ++) {
scanf("%s%s%d",s1,s2,&d);
int x,y;
if(!pos[getval(s1)]) {
x = pos[getval(s1)] = ++ c;
strcpy(s[x],s1);///反过来要知道 pos对应的字符串
}
else x = pos[getval(s1)];
if(!pos[getval(s2)]) {
y = pos[getval(s2)] = ++ c;
strcpy(s[y],s2);
}
else y = pos[getval(s2)];
mp[x][y] += d;
mp[y][x] += d;
val[x] += d;
val[y] += d;
}
for(int i = 1;i <= c;i ++) {
if(!vis[i]) {
temp = 0;
dfs(i);
if(ans[ant].num > 2 && temp > k)ant ++;///满足条件才算
else ans[ant].num = 0,ans[ant].id = 0;
}
}
printf("%d\n",ant);
sort(ans,ans + ant,cmp);
for(int i = 0;i < ant;i ++) {
printf("%s %d\n",s[ans[i].id],ans[i].num);
}
}
原文地址：https://www.cnblogs.com/8023spz/p/9194195.html