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

题意:

给定n条记录(注意不是n个人的记录),两个人之间的关系的权值为这两个人之间所有电话记录的时间之和。

一个连通块的权值为所有关系权值之和。

如果一个连通块节点数大于2,且权值大于给定的k,称这是一个gang,拥有关系权值和最多的人是gang的头。

要求输出gang的数量,每个gang的头,每个gang的人数。按照gang的头的字典序排序。

题解:

bfs求连通块。有几个注意点:

1、给定的是n条记录,n<=1000, 这说明人数应该是2000以内而不是1000以内。否则会测试点3运行时错误。

2、每一条记录都要考虑,bfs时不能仅判断这个节点是否被访问,还应该设置边的vis数组。

错误点:

1、忘记排序,测试点2,5答案错误,否则会测试点3运行时错误

2、n<=1000, 这说明人数应该是2000以内而不是1000以内

AC代码:

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<cstring>
using namespace std;
map<string,int>m1;
map<int,string>m2;
vector<int>v[];//给定的是n条记录,n<=1000, 这说明人数应该是2000以内而不是1000以内。测试点3运行时错误
int ok[];//标记有没有被访问过
struct node{//存储最终答案
string head;
int num;
}ans[];
int w[];//计算每个点的权重
int n,minw;
queue<int>q;
int k=;//map里的个数
int ans_num=;//答案个数
bool cmp(node x,node y){
return x.head<y.head;
}
void bfs(int x){
int w_sum=;//计算总权重
int num=;//计算人数
int max_w=w[x];
int head=x;
q.push(x);
ok[x]=;//标记有没有被访问过
num++;
w_sum+=w[x];
while(!q.empty()){
int a=q.front();
q.pop();
for(int i=;i<v[a].size();i++){
int b=v[a].at(i);
if(ok[b]) continue;
if(max_w<w[b]){//找出权重的为头目
head=b;
max_w=w[b];
}
ok[b]=;
q.push(b);
w_sum+=w[b];
num++;
}
}
w_sum/=;
if(num>= && w_sum>minw){
//cout<<"答案:num"<<num<<" "<<m2[head]<<" "<<ans_num<<" w_sum "<<w_sum<<endl;
node answer;
answer.num=num;
answer.head=m2[head];
ans[++ans_num]=answer;
}
}
int main(){
cin>>n>>minw;
memset(w,,sizeof(w));
memset(ok,,sizeof(ok));
for(int i=;i<=n;i++){
if(!v[i].empty()) v[i].clear();
}
for(int i=;i<=n;i++){
string na1,na2;
int ww;
cin>>na1>>na2>>ww;
if(!m1[na1]) {
m2[k]=na1;
m1[na1]=k++;
}
if(!m1[na2]) {
m2[k]=na2;
m1[na2]=k++;
}
w[m1[na1]]+=ww;
w[m1[na2]]+=ww;
v[m1[na1]].push_back(m1[na2]);
v[m1[na2]].push_back(m1[na1]);
}
for(int i=;i<=n;i++){
if(!ok[i]){
bfs(i);
}
}
cout<<ans_num<<endl;
sort(ans+,ans++ans_num,cmp);//排序,一开始忘记排了
for(int i=;i<=ans_num;i++){
cout<<ans[i].head<<" "<<ans[i].num<<endl;
}
return ;
}

PAT 甲级 1034 Head of a Gang (30 分)(bfs,map,强连通)的更多相关文章

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

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

  2. PAT甲级1034. Head of a Gang

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

  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 甲级 1064 Complete Binary Search Tree (30 分)(不会做,重点复习,模拟中序遍历)

    1064 Complete Binary Search Tree (30 分)   A Binary Search Tree (BST) is recursively defined as a bin ...

  5. PAT 甲级 1053 Path of Equal Weight (30 分)(dfs,vector内元素排序,有一小坑点)

    1053 Path of Equal Weight (30 分)   Given a non-empty tree with root R, and with weight W​i​​ assigne ...

  6. PAT 甲级 1038 Recover the Smallest Number (30 分)(思维题,贪心)

    1038 Recover the Smallest Number (30 分)   Given a collection of number segments, you are supposed to ...

  7. 【PAT甲级】1034 Head of a Gang (30 分)

    题意: 输入两个正整数N和K(<=1000),接下来输入N行数据,每行包括两个人由三个大写字母组成的ID,以及两人通话的时间.输出团伙的个数(相互间通过电话的人数>=3),以及按照字典序输 ...

  8. PAT Advanced 1034 Head of a Gang (30) [图的遍历,BFS,DFS,并查集]

    题目 One way that the police finds the head of a gang is to check people's phone calls. If there is a ...

  9. PAT甲级1034 Head of a Gang【bfs】

    题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805456881434624 题意: 给定n条记录(注意不是n个人的 ...

随机推荐

  1. 本地jar通过maven命令导到本地仓库里

    mvn install:install-file -Dfile=D:\repo\mybtais-generator-1.0.0.jar -DgroupId=mybatis.plugins -Darti ...

  2. Mybatis之foreach批量插入

    1接口 public boolean insertMembersBatch(@Param("memberList") List<Members> members); @ ...

  3. [hdoj5927][dfs]

    http://acm.hdu.edu.cn/showproblem.php?pid=5927 Auxiliary Set Time Limit: 9000/4500 MS (Java/Others)  ...

  4. git查看commit提交记录详情

    相关的命令: git log:查看所有的commit提交记录: git show: 查看提交的详情: 首先,需要通过git log打印所有commit记录,例如: 1.查看最新的commit:git ...

  5. 34 | 到底可不可以使用join?

    在实际生产中,关于 join 语句使用的问题,一般会集中在以下两类: 我们 DBA 不让使用 join,使用 join 有什么问题呢? 如果有两个大小不同的表做 join,应该用哪个表做驱动表呢? 今 ...

  6. java利用webuploader实现超大文件分片上传、断点续传

    我们平时经常做的是上传文件,上传文件夹与上传文件类似,但也有一些不同之处,这次做了上传文件夹就记录下以备后用. 首先我们需要了解的是上传文件三要素: 1.表单提交方式:post (get方式提交有大小 ...

  7. xfce 快捷键 命令整理

    本文链接:https://blog.csdn.net/cFarmerReally/article/details/53375956 转载自:https://my.oschina.net/u/56535 ...

  8. [Codevs] 一塔湖图

    http://codevs.cn/problem/1024/ floyd 走起 #include <iostream> #include <cstdio> #include & ...

  9. P2679 子串 DP

    P2679 子串 DP 从字符串A中取出\(k\)段子串,按原顺序拼接,问存在多少个方案使拼接的字符串与字符串B相同 淦,又是这种字符串dp 设状态\(ans[i][j][k]\)表示A串位置\(i\ ...

  10. Cogs 731. [网络流24题] 最长递增子序列(最大流)

    [网络流24题] 最长递增子序列 ★★★☆ 输入文件:alis.in 输出文件:alis.out 简单对比 时间限制:1 s 内存限制:128 MB «问题描述: 给定正整数序列x1,-, xn. ( ...