1034. Head of a Gang (30)
来源:互联网 发布:js 所见即所得编辑器 编辑:程序博客网 时间:2024/06/07 17:44
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 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 59AAA BBB 10BBB AAA 20AAA CCC 40DDD EEE 5EEE DDD 70FFF GGG 30GGG HHH 20HHH FFF 10Sample Output 1:
2AAA 3GGG 3Sample Input 2:
8 70AAA BBB 10BBB AAA 20AAA CCC 40DDD EEE 5EEE DDD 70FFF GGG 30GGG HHH 20HHH FFF 10Sample Output 2:
0
#include<iostream>#include<cstring>#include<map>#include<queue>#include<algorithm>#include<vector>using namespace std;struct Gang{string head;int sumperson;};struct Gang gang[10010];map<int ,string> int_str;map<string,int> str_int;vector <int > v[10010];int ind=1;int index1=0;int n,k;int vis[10005],sum_time[10005];bool cmp(struct Gang a,struct Gang b){ return a.head<b.head;}void bfs(int start){ queue <int > q; q.push(start); int sum=0,sum_person=0,head=start,max_time=sum_time[start]; while(!q.empty()) { int temp=q.front(); q.pop(); if (vis[temp]) continue; sum+=sum_time[temp];//此帮派的总通话时间 vis[temp]=1; sum_person++; if (sum_time[temp]>max_time)//通过通话时间找的帮主 { max_time=sum_time[temp]; head=temp; } for (int i=0;i<v[temp].size();i++) { int tt=v[temp][i]; q.push(tt); } } if (sum_person>2&&sum/2>k) { gang[index1].head=int_str[head]; gang[index1].sumperson=sum_person; index1++; }}int toint(string s){ if (str_int[s]==0) { str_int[s]=ind; int_str[ind]=s; return ind++; } else return str_int[s];}int main(){ cin>>n>>k; for (int i=0;i<n;i++) { string a,b; int time; cin>>a>>b>>time; int a_num=toint(a); int b_num=toint(b); sum_time[a_num]+=time; sum_time[b_num]+=time; v[a_num].push_back(b_num); } for (int i=0;i<ind;i++) { bfs(i); } sort(gang,gang+index1,cmp); cout<<index1<<endl; for (int i=0;i<index1;i++) { cout<<gang[i].head<<" "<<gang[i].sumperson<<endl; } return 0;}
- 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- PAT 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- PAT 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- pat 1034. Head of a Gang (30)
- PAT 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- 1034. Head of a Gang (30)
- java.util.zip.ZipException: duplicate entry: org/apache/xmlbeans/xml/stream/Location.class
- [RCNN]Rich feature hierarchies for accurate object detection and semantic segmentation
- Naive Bayes与Laplace smoothing 朴素贝叶斯算法拉普拉斯平滑
- Java中的Enum的使用与分析
- mysql性能优化-慢查询分析、优化索引和配置
- 1034. Head of a Gang (30)
- monkey获取包名和其他一些基本使用方法
- 《智能时代》读后感
- 如何同时打开两个excel窗口
- 人脸识别opencv
- 没什么事,写了两个导航栏的demo
- 微信公众号生成永久二位码
- HTML&CSS精选笔记_列表与超链接
- 关于动态添加的元素不能触发click事件