1034. Head of a Gang (30)
来源:互联网 发布:奥米姿淘宝 编辑:程序博客网 时间:2024/06/08 11:55
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 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
参照上机指南P348
#include<stdio.h>#include<string>#include<iostream>#include<map>#include<vector>using namespace std;int sumtime[2010];int visit[2010];vector<int>adj[2010];int n,k,person;int totalperson,totaltime,head;map<int,string>inttostring;map<string,int>stringtoint;map<string,int>gang;int change(string s){if(stringtoint.find(s)!=stringtoint.end()){return stringtoint[s];}else{stringtoint[s]=person;inttostring[person]=s;return person++;}}void dfs(int s){visit[s]=1;totalperson++;totaltime=totaltime+sumtime[s];if(sumtime[s]>sumtime[head]){head=s;}int i;for(i=0;i<adj[s].size();i++){int next=adj[s][i];if(visit[next]==0){dfs(next);}}}void dfstravel(){int i;for(i=0;i<person;i++){if(visit[i]==0){totalperson=0;totaltime=0;head=i;dfs(i);if(totalperson>2&&totaltime>2*k){// totaltime算的是每个人的时间,等于2倍边权 gang[inttostring[head]]=totalperson;}}}}int main(){int i,time;string s1,s2;scanf("%d %d",&n,&k);for(i=0;i<n;i++){cin>>s1>>s2>>time;int id1=change(s1);int id2=change(s2);sumtime[id1]=sumtime[id1]+time;sumtime[id2]=sumtime[id2]+time;adj[id1].push_back(id2);adj[id2].push_back(id1);}dfstravel();printf("%d\n",gang.size());map<string,int>::iterator it=gang.begin();for(;it!=gang.end();it++){cout<<it->first<<" "<<it->second<<endl;}}
- 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)
- 如何自定义RecycleView item的间距
- Sending 'ShareView *const _strong' to parameter of incompatible type 'id<UIAlertViewDelegate>'
- 小白配电脑
- gitlab 代码提交与推送
- linux远程连接windows服务器操作
- 1034. Head of a Gang (30)
- css 绘制三角形箭头
- python 继承和多态
- 【Oracle经典】132个oracle热门精品资料——下载目录
- [原创]在HP DL380 G7服务器上部署基于Ubuntu Server 16.04 和 VirtualBox的云平台
- java解析javascript方法,scriptengine初体验,实现后台调用js方法验证。
- 磁盘规划 迁移/home
- MongoDB数据库安装配置和基本操作
- 7. Reverse Integer(反转整型) —— Java