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 = ;
}
}ans[];///记录答案
int n,k,c,d,pos[],mp[][],vis[],val[],ant,temp;///pos记录hashing值对应1~c的第几个值
char s1[],s2[],s[][];
int getval(char *t) {///hashing值
return (t[] - 'A') * * + (t[] - 'A') * + t[] - 'A';
}
void dfs(int p) {///搜索某个连通分支
vis[p] = ;///标记
ans[ant].num ++;///人数加一
if(val[p] > val[ans[ant].id])ans[ant].id = p;///更新head
for(int i = ;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]) < ;
}
int main() {
scanf("%d%d",&n,&k);
for(int i = ;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 = ;i <= c;i ++) {
if(!vis[i]) {
temp = ;
dfs(i);
if(ans[ant].num > && temp > k)ant ++;///满足条件才算
else ans[ant].num = ,ans[ant].id = ;
}
}
printf("%d\n",ant);
sort(ans,ans + ant,cmp);
for(int i = ;i < ant;i ++) {
printf("%s %d\n",s[ans[i].id],ans[i].num);
}
}

1034 Head of a Gang (30)(30 分)的更多相关文章

  1. 1034 Head of a Gang (30 分)

    1034 Head of a Gang (30 分) One way that the police finds the head of a gang is to check people's pho ...

  2. 1034 Head of a Gang (30 分)(图的遍历or并查集)

    dfs #include<bits/stdc++.h> using namespace std; ; int mp[N][N]; int weight[N]; int vis[N]; ma ...

  3. pat 甲级 1034 ( Head of a Gang )

    1034 Head of a Gang (30 分) One way that the police finds the head of a gang is to check people's pho ...

  4. PAT 甲级 1034 Head of a Gang (30 分)(bfs,map,强连通)

    1034 Head of a Gang (30 分)   One way that the police finds the head of a gang is to check people's p ...

  5. pat 甲级 1034. Head of a Gang (30)

    1034. Head of a Gang (30) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue One wa ...

  6. PAT 1034 Head of a Gang[难][dfs]

    1034 Head of a Gang (30)(30 分) One way that the police finds the head of a gang is to check people's ...

  7. PAT 1034. Head of a Gang

    1034. Head of a Gang (30) One way that the police finds the head of a gang is to check people's phon ...

  8. etectMultiScale(gray, 1.2,3,CV_HAAR_SCALE_IMAGE,Size(30, 30))

    # 函数原型detectMultiScale(gray, 1.2,3,CV_HAAR_SCALE_IMAGE,Size(30, 30)) # gray需要识别的图片 # 1.03:表示每次图像尺寸减小 ...

  9. PAT甲级1034. Head of a Gang

    PAT甲级1034. Head of a Gang 题意: 警方找到一个帮派的头的一种方式是检查人民的电话.如果A和B之间有电话,我们说A和B是相关的.关系的权重被定义为两人之间所有电话的总时间长度. ...

  10. c# 时间格式处理,获取格式: 2014-04-12T12:30:30+08:00

    C#  时间格式处理,获取格式: 2014-04-12T12:30:30+08:00 一.获取格式: 2014-04-12T12:30:30+08:00 方案一:(局限性,当不是当前时间时不能使用) ...

随机推荐

  1. 个人笔记-CSS

    http://localhost:1081/sdfsdfs/config-browser/actionNames.action 超出容器文字隐藏 .hiddenoverflowtext { width ...

  2. OpenSUSE 13.1上安装StrongSwan

    结果: 1)iOS 7.1设备能够拨IPSec VPN到StrongSwan电脑上面来 - Connect to VPN 2)iOS 设备浏览器能够訪问StrongSwan VPN所在的内网地址服务器 ...

  3. chessy 提高篇系列 阅读笔记

    java提高篇(一)—–理解java的三大特性之封装 封装的好处, 汇聚属性和方法 减少修改对 其他处的影响 控制get和set方法. java提高篇(二)—–理解java的三大特性之继承 继承的好处 ...

  4. 09-redis事务及锁应用

    Redis 中的事务 Redis支持简单的事务 Redis与 mysql事务的对比 ------------------------------------------------------- My ...

  5. 2015 Astar Contest - Round 3 题解

    1001 数长方形 题目大意 平面内有N条平行于坐标轴的线段,且不会在端点处相交 问共形成多少个矩形 算法思路 枚举4条线段的全部组合.分别作为矩形四条边.推断是否合法 时间复杂度: O(N4) 代码 ...

  6. myeclipse中disable maven nature怎么恢复

    eclipse更新maven的时候,不小心手一抖,点上了Disable Maven Nature,然后工程右键菜单中的Maven栏就不见了! 其实这是把maven工程转换成了一般工程,再转回来就好了. ...

  7. Java中如何判断一个日期字符串是否是指定的格式

    判断日期格式是否满足要求 import java.text.ParseException;import java.text.SimpleDateFormat;import java.util.Date ...

  8. Makefile注意点总结

    1 "="和":=" "="号赋值时,如果右边的值里面有未展开的变量,要等到整个Makefile的变量处理完之后,再展开,也就是说,如果该未 ...

  9. 【题解】CF1103D Professional layer

    [题解]CF1103DProfessional layer 神题做前先\(orzyyb\) 一个很好的性质(之前也见过但是没有想到的) zhengchu \(gcd\le 10^{12}\) 所以不同 ...

  10. 【题解】CF359B Permutation

    [题解]CF359B Permutation 求一个长度为\(2n\)的序列,满足\(\Sigma |a_{2i}-a_{2i-1}|-|\Sigma a_{2i}-a_{2i-1}|=2k\) 这种 ...