PAT_1034
来源:互联网 发布:淘宝机票 编辑:程序博客网 时间:2024/05/04 09:56
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 ph
one 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 <vector>#include <string>#include <map>using namespace std;map<string, vector<string> > jointlist;map<string, int> weight;map<string, int> visit;string head;int total;int member;void dfs(string str){member += 1;visit[str] = 1;total += weight[str];if(weight[str] > weight[head])head = str;vector<string>::const_iterator it = jointlist[str].begin();while(it != jointlist[str].end()){if(visit[*it] == 0)dfs(*it);++it;}}int main(){int N,K;cin>>N>>K;int count = 0;map<string, int> ret;for(int i = 1; i <= N; ++i){string s1,s2;int t;cin>>s1>>s2>>t;if(weight.find(s1) == weight.end())weight[s1] = t;elseweight[s1] += t;if(weight.find(s2) == weight.end())weight[s2] = t;elseweight[s2] += t;jointlist[s1].push_back(s2);jointlist[s2].push_back(s1);visit[s1] = 0;visit[s2] = 0;}map<string, int>::const_iterator it = visit.begin();while(it != visit.end()){if((*it).second == 0){total = 0;member = 0;head = it->first;dfs(it->first);if(total/2 > K && member >2){count += 1;ret[head] = member;}}++it;}cout<<count<<endl;it = ret.begin();while(it!=ret.end()){cout<<it->first<<" "<<it->second<<endl;++it;}}
- pat_1034
- PAT_1034
- PAT_1034: Head of a Gang
- PAT_1034. Head of a Gang
- PAT_1021
- Unity引擎链接mySQL数据库
- PAT_1030
- Codeforces Round #234 (Div. 2) A. Inna and Choose Options
- C++选择排序法,按从大到小排序,long long 型
- PAT_1034
- PAT_1054
- PAT_1067
- PAT_1072
- 格式的分公司地方很多附加分工会客观hi两个号i类
- Codeforces Round #234 (Div. 2) B. Inna and New Matrix of Candies
- stm32的RTC
- 黑马程序员-属性和字段的惯用命名方法
- 学习笔记心得&作业