Pat(Advanced Level)Practice--1034(Head of a Gang)
来源:互联网 发布:99scsc最新域名 编辑:程序博客网 时间:2024/05/22 15:27
Pat1034代码
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 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<string>#include<map>#include<vector>using namespace std;map<string,vector<string> >adjlist;//邻接链表存储map<string,int> weight;//存储权重map<string,int> visited;//设置访问标志map<string,int> ans;//保存结果int cnt,sum;string head;void DFS(string str){visited[str]=1;cnt++;sum+=weight[str];if(weight[str]>weight[head])head=str;else if(weight[str]==weight[head]&&str<head)//如果一个Gang中存在多个head=str; //权重一样的成员,则取字母顺序最小的vector<string>::iterator it;for(it=adjlist[str].begin();it!=adjlist[str].end();it++){if(visited[*it]==0)DFS(*it);}}int main(int argc,char *argv[]){int n,k;cin>>n>>k;for(int i=0;i<n;i++){string name1,name2;int time;cin>>name1>>name2>>time;adjlist[name1].push_back(name2);adjlist[name2].push_back(name1);visited[name1]=0;visited[name2]=0;weight[name1]+=time;//算出每个节点的总权重weight[name2]+=time;}map<string,int>::iterator it;for(it=visited.begin();it!=visited.end();it++){if(visited[it->first]==0){cnt=0;sum=0;head=it->first;DFS(it->first);if(cnt>2&&sum/2>k)//sum求值的重复加了一遍权重ans[head]=cnt;}}cout<<ans.size()<<endl;map<string,int>::iterator iter;for(iter=ans.begin();iter!=ans.end();iter++)cout<<iter->first<<" "<<iter->second<<endl;return 0;}第一感觉貌似是个并查集问题,但是实现起来好麻烦。最后才选择了map,至少这样就不用排序了。。。
- Pat(Advanced Level)Practice--1034(Head of a Gang)
- PAT (Advanced Level) Practise 1034 Head of a Gang (30)
- PAT (Advanced Level) Practise 1034 Head of a Gang (30)
- 【PAT】【Advanced Level】1034. Head of a Gang (30)
- PAT (Advanced Level) 1034. Head of a Gang (30) 黑帮头目,并查集
- PAT (Advanced) 1034. Head of a Gang (30)
- pat 1034 Head of a Gang
- PAT 1034 Head of a Gang 模拟
- 1034. Head of a Gang (30)【离散化+并查集+搜索】——PAT (Advanced Level) Practise
- PAT Head of a Gang
- 【PAT 1034】 Head of a Gang 图论DFS
- PAT 1034 Head of a Gang(图遍历+BFS)
- PAT 1034. Head of a Gang (30)
- PAT 1034. Head of a Gang
- PAT 1034. Head of a Gang
- PAT 1034. Head of a Gang
- PAT 1034. Head of a Gang (30)
- pat 1034. Head of a Gang (30)
- HDU 1005Number Sequence
- 皇上是船,百姓是水。水能载舟亦能覆舟
- 第四周项目一
- 深究指针与引用的差别
- Mac安装nginx
- Pat(Advanced Level)Practice--1034(Head of a Gang)
- C/C++中运算符优先级汇总
- zoj 3640 Help Me Escape(概率dp)
- 雷锋的故事
- HDU 4358 分块
- 3.圆的面积
- linux下的access()函数判断文件是否存在、打印时间
- 4.Fibonacci数列
- Apache Httpd常用命令