PAT A1034.Head of a Gang

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 59
AAA BBB 10
BBB AAA 20
AAA CCC 40
DDD EEE 5
EEE DDD 70
FFF GGG 30
GGG HHH 20
HHH FFF 10

Sample Output 1:

2
AAA 3
GGG 3

Sample Input 2:

8 70
AAA BBB 10
BBB AAA 20
AAA CCC 40
DDD EEE 5
EEE DDD 70
FFF GGG 30
GGG HHH 20
HHH FFF 10

Sample Output 2:

0

题目描述:

 

题目思路:

 

题目核心代码:

//计算团伙的头目、成员个数、总通话时间
void DFS(int member, int& head, int& numMember, int& totalValue){
    vis[member] = true;
    numMember++;
    if(weight[member]>weight[head]) head=member;
    for(int i=0; i<numPerson; i++){
        if(G[member][i]>0){
            totalValue += G[member][i];//先加权值
            G[member][i]=G[i][member]=0;    //加完就删,防止回头
            if(vis[i]==false){

                DFS(i, head, numMember, totalValue);
            }
        }
    }
}
//遍历图,找到头目和团伙个数,获取每个团伙的信息
void DFSTraversal(){
    for(int i=0; i<numPerson; i++){
        if(vis[i]==false){
            int head = i;
            int numMember = 0;
            int totalValue = 0;
            DFS(i, head, numMember, totalValue);
            if(numMember>2 && totalValue>k){
                Gang[intToString[head]] = numMember;
                //intToString在这里用,转换为团伙头目名称
            }
        }
    }
}

题目完整代码:

#include <iostream>
#include <string>
#include <map>

using namespace std;

const int maxn = 2010;           //通话记录的二倍

map<int,string> intToString;//人员编号和人员名称键值对
map<string, int> stringToInt;
map<string, int> Gang;      //团伙头目,团伙人数,也可以用结构体来做

int G[maxn][maxn]={0};      //邻接矩阵
int weight[maxn] = {0};     //每个人通话时间总和
int n,k,numPerson=0;        //通信条数,阈值,人员总数
bool vis[maxn] = {false};     //该成员是否被访问

//计算团伙的头目、成员个数、总通话时间
void DFS(int member, int& head, int& numMember, int& totalValue){
    vis[member] = true;
    numMember++;
    if(weight[member]>weight[head]) head=member;
    for(int i=0; i<numPerson; i++){
        if(G[member][i]>0){
            totalValue += G[member][i];//先加权值
            G[member][i]=G[i][member]=0;    //加完就删,防止回头
            if(vis[i]==false){

                DFS(i, head, numMember, totalValue);
            }
        }
    }
}

//遍历图,找到头目和团伙个数,获取每个团伙的信息
void DFSTraversal(){
    for(int i=0; i<numPerson; i++){
        if(vis[i]==false){
            int head = i;
            int numMember = 0;
            int totalValue = 0;
            DFS(i, head, numMember, totalValue);
            if(numMember>2 && totalValue>k){
                Gang[intToString[head]] = numMember;
                //intToString在这里用,转换为团伙头目名称
            }
        }
    }
}

//判断str是否出现过,如果没有则添加,如果添加过返回他的编号
int Change(string str){
    if(stringToInt.find(str) != stringToInt.end()){     //找到了
        return stringToInt[str];    //返回编号
    }
    else{      //找不到
        stringToInt[str] = numPerson;
        intToString[numPerson] = str;
        return numPerson++;
    }
}

int main()
{
    string str1, str2;
    int w;

    cin>>n>>k;
    for(int i=0; i<n; i++){
        cin>>str1>>str2>>w;
        int id1 = Change(str1);
        int id2 = Change(str2);
        weight[id1] += w;
        weight[id2] += w;
        G[id1][id2] += w;   //建立图,插入边
        G[id2][id1] += w;
        //这里先加权值再进行遍历
    }

    DFSTraversal();//遍历

    cout<<Gang.size()<<endl;

    map<string, int>::iterator it;
    for(it=Gang.begin(); it!=Gang.end(); it++){//遍历Gang
        cout<<it->first<<" "<<it->second<<endl;
    }

    return 0;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值