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
读懂题之后就想用图的知识做,每个连通分支如果结点个数不超过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 分)的更多相关文章
- 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 ...
- 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 ...
- 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 ...
- 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 ...
- pat 甲级 1034. Head of a Gang (30)
1034. Head of a Gang (30) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue One wa ...
- 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 ...
- 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 ...
- 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:表示每次图像尺寸减小 ...
- PAT甲级1034. Head of a Gang
PAT甲级1034. Head of a Gang 题意: 警方找到一个帮派的头的一种方式是检查人民的电话.如果A和B之间有电话,我们说A和B是相关的.关系的权重被定义为两人之间所有电话的总时间长度. ...
- c# 时间格式处理,获取格式: 2014-04-12T12:30:30+08:00
C# 时间格式处理,获取格式: 2014-04-12T12:30:30+08:00 一.获取格式: 2014-04-12T12:30:30+08:00 方案一:(局限性,当不是当前时间时不能使用) ...
随机推荐
- ARM和STM32的区别及ARM公司架构的发展
ARM和STM32的区别及ARM公司架构的发展 转:https://www.cnblogs.com/kwdeblog/p/5260348.html ARM是英国的芯片设计公司,其最成功的莫过于32位嵌 ...
- centos-64整合nginx和tomcat
centos-64整合nginx和tomcat 分类: Linux 2013-04-25 10:41 128人阅读 评论(0) 收藏 举报 1.安装wget和依赖包 yum install wget ...
- Highcharts使用表格数据绘制图表
Highcharts使用表格数据绘制图表 在Highcharts中,同意用户使用网页中现有的表格数据作为数据来源,然后依据该数据来源绘制图表.对于一个典型的HTML表格.当中,第一列的数据会作为x轴刻 ...
- 看完这篇还不会自定义 View ,我跪搓衣板
自定义 View 在实际使用的过程中,我们经常会接到这样一些需求,比如环形计步器,柱状图表,圆形头像等等,这时我们通常的思路是去Google 一下,看看 github 上是否有我们需要的这些控件,但是 ...
- 基于UML的需求分析和系统设计个人体会
阅读了http://www.uml.org.cn/oobject/201405123.asp文章之后,对使用UML进行系统的需求分析和设计有了一个基础的理解.在此做一下整理. 1.项目开始阶段 项 ...
- a标签javascript传参不正确的解决办法!
代码部分: <a href="javascript:void(0);" onClick="findList(${goodsClassify.id})"&g ...
- node.js的http模块的基础 学到的东西
node.js的http模块的基础 学到的东西 其中客户端:我们在node.js中如果要请求服务端中的js或者其他脚本的话要使用http.request()方法他会返回http.ClientReque ...
- C# C/S程序使用HTML文件作为打印模板
C# C/S程序使用HTML文件作为打印模板 在网上找了一堆的资料,整理到郁闷呀,慢慢试慢慢改.哎,最终成功了,哈,菜鸟伤不起呀 public partial class Print : Form ...
- Project Euler:Problem 41 Pandigital prime
We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly o ...
- 远程访问(HttpClient和HttpResponse的使用) 原型模式
package com.webserver.webservice; import java.io.ByteArrayInputStream; import java.io.FileOutputStre ...