PAT甲级1034 Head of a Gang (30分)

最新推荐文章于 2022-05-15 10:53:23 发布

Douglas_LT

最新推荐文章于 2022-05-15 10:53:23 发布

阅读量105

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/Douglas_LT/article/details/109486303

版权

PAT 专栏收录该内容

53 篇文章 0 订阅

订阅专栏

#pragma warning(disable:4996)
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<map>
#include<iostream>
using namespace std;

const int maxn = 2010;
const int INF = 1000000000;

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] = { 0 };

void DFS(int nowVisit, int &head, int &numMember, int &totalValue)
{
	numMember++;
	vis[nowVisit] = 1;
	if (weight[nowVisit] > weight[head])
	{
		head = nowVisit;
	}
	for (int i = 0; i < numPerson; i++)
	{
		if (G[nowVisit][i] > 0)
		{
			totalValue += G[nowVisit][i];
			G[i][nowVisit] = G[nowVisit][i] = 0;
			if (vis[i] == 0)
			{
				DFS(i, head, numMember, totalValue);
			}
		}
	}
}

void DFStrave()
{
	for (int i = 0; i < numPerson; i++)
	{
		if (vis[i] == 0)
		{
			int head = i, numMember = 0, totalvalue = 0;
			DFS(i, head, numMember, totalvalue);
			if (numMember > 2 && totalvalue > k)
			{
				Gang[intTostring[head]] = numMember;
			}
		}
	}
}

int change(string str)
{
	if (stringToint.find(str) != stringToint.end())
	{
		return stringToint[str];
	}
	else
	{
		stringToint[str] = numPerson;
		intTostring[numPerson] = str;
		return numPerson++;
	}
}

int main()
{
	scanf("%d%d", &n, &k);
	int weigh;
	string str1, str2;
	str1.resize(4);
	str2.resize(4);
	for (int i = 0; i < n; i++)
	{
		scanf("%s%s%d", &str1[0],&str2[0],&weigh);
		int id1 = change(str1);
		int id2 = change(str2);
		weight[id1] += weigh;
		weight[id2] += weigh;
		G[id1][id2] += weigh;
		G[id2][id1] += weigh;
	}
	DFStrave();
	printf("%d\n", Gang.size());
	map<string, int>::iterator it;
	for (it = Gang.begin(); it != Gang.end(); it++)
	{
		printf("%s %d\n", it->first.c_str(), it->second);
	}
	return 0;
}