1034. Head of a Gang (30)
来源:互联网 发布:利息的算法银行 编辑:程序博客网 时间:2024/06/04 08:50
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 <string>#include <vector>#include <algorithm>#include <cstring>#include <map>using namespace std;const int maxn = 2005;int ufs[maxn],tottime[maxn],indtime[maxn];vector<int> mem[maxn];map<string,int> str2int;map<int,string> int2str;int id = 0;int s2i(const string &s){auto itr = str2int.find(s);if(itr == str2int.end()){int t = id++;int2str[t] = s;return str2int[s] = t;}return itr->second;}string i2s(int x){return int2str[x];}int find_set(int x){return x == ufs[x] ? x :ufs[x] = find_set(ufs[x]);}bool cmp(int x,int y){return indtime[x] < indtime[y];}int n,k;int main(){cin>>n>>k;string a,b;int c,d,e;for(int i=0;i<maxn;i++){ufs[i] = i;tottime[i] = 0;mem[i].push_back(i);}for(int i=0;i<n;i++){cin>>a>>b>>e;c = s2i(a);d = s2i(b);indtime[c] += e;indtime[d] += e;int r1 = find_set(c),r2 = find_set(d);if(r1 != r2){ufs[r1] = r2;tottime[r2] = tottime[r1] + tottime[r2] + e;mem[r2].insert(mem[r2].end(),mem[r1].begin(),mem[r1].end());}elsetottime[r1] += e;}vector<int> gangs;map<string,int> res;for(int i=0;i<maxn;i++)if(ufs[i] == i && mem[i].size() > 2 && tottime[i] > k)gangs.push_back(i);cout<<gangs.size()<<endl;for(int i=0;i<gangs.size();i++){int t = max_element(mem[gangs[i]].begin(),mem[gangs[i]].end(),cmp) - mem[gangs[i]].begin();res[i2s(mem[gangs[i]][t])] = mem[gangs[i]].size();}for(auto itr = res.begin();itr != res.end();++itr)cout<<itr->first<<" "<<itr->second<<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)
- 从零开始搭建opencv3.0交叉编译环境(Ubuntu14.04+eclipse)(三)
- 安装office时报错:an error occurred during the installation of assmbly component
- Curator服务发现
- 文件存取的四种方法
- java socket编程中BufferedReader使用的问题
- 1034. Head of a Gang (30)
- UI基础-04 简单的加法计算器
- Codeforces Round #326 (Div. 2) B. Duff in Love (分解质因子)
- 写在大学的最后一个寒假
- POJ 2566 Bound Found Time(尺取法—前缀和排序处理)
- 出门问问
- 蓝桥杯 历届试题 回文数字
- 路上歇息一下
- 1035. Password (20)