PAT 甲级 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.

输入

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.

输出

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.

思路

本质上是一个深搜或者广搜题,唯一难点是给的标号是字符串而不是数字,因此用map可以解决这个问题。

代码

#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<cstdio>
#include<string.h>
typedef struct node {
    char gang[1000] = { 0 };
    int number;
}Head;
using namespace std;
int N, mmax;
Head answer[10001];
map<int, string> relate_two;
map<string, int> relate;
map<string, string> one;
int graph[10001][10001] = { 0 };
int weight[10001] = { 0 };
int cur = 0;
int pan[10001] = { 0 };
int all;
int number;
int gang = 0;
bool cmp(Head a, Head b)
{
    if (strcmp(a.gang, b.gang) < 0)
    {
        return true;
    }
    return false;
}
int change(string str, int w)
{
    if (relate.find(str) != relate.end())
    {
        weight[relate[str]] += w;
        return relate[str];
    }
    weight[cur] += w;
    relate[str] = cur;
    return -1;
}
void dfs(int t)
{
    if (weight[t] > weight[gang])
    {
        gang = t;
    }
    pan[t] = 1;
    for (int i = 0; i < cur; i++)
    {
        if (pan[i] != 1 && graph[t][i]==1)
        {
            all += weight[i];
            number++;
            dfs(i);
        }
    }
}
int main()
{
    cin >> N >> mmax;

    for (int i = 0; i < N; i++)
    {
        string str1, str2;
        int w;
        cin >> str1 >> str2 >> w;
        int one = change(str1,w);
        if (one == -1)
        {
            one = cur;
            relate_two[one] = str1;
            cur++;
        }
        int two = change(str2,w);
        if (two == -1)
        {
            two = cur;
            relate_two[two] = str2;
            cur++;
        }
        graph[one][two] = 1;
        graph[two][one] = 1;
    }
    int temp = 0;
    for (int i = 0; i < cur; i++)
    {
        if (pan[i] != 1)
        {
            number = 1;
            all = weight[i];
            gang = i;
            dfs(i);
            if (number > 2 && all > 2*mmax)
            {
                strcpy(answer[temp].gang, relate_two[gang].c_str());
                answer[temp].number = number;
                temp++;
            }
        }
    }
    sort(answer, answer + temp, cmp);
    cout << temp << endl;
    for (int i = 0; i < temp; i++)
    {
        cout << answer[i].gang << " " << answer[i].number << endl;
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值