N - Cat VS Dog

最新推荐文章于 2024-10-12 22:47:18 发布

xiuxing05

最新推荐文章于 2024-10-12 22:47:18 发布

阅读量68

点赞数

分类专栏： 2022GDUT寒假集训文章标签： c++ c语言算法图论

本文链接：https://blog.csdn.net/xiuxing05/article/details/129025264

版权

2022GDUT寒假集训专栏收录该内容

11 篇文章 0 订阅

订阅专栏

文章描述了一个关于动物园管理员试图最大化儿童幸福感的问题。每个孩子都有喜欢和不喜欢的动物，管理员需要移除某些动物以使最多的孩子满意。解决方案涉及计算最大独立集，这等价于找到最大匹配数，采用匈牙利算法来实现。代码示例展示了如何处理输入并运用该算法找出答案。

摘要由CSDN通过智能技术生成

一、题目：

The zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal and a dislike-animal, if the child's like-animal is a cat, then his/hers dislike-animal must be a dog, and vice versa.
Now the zoo administrator is removing some animals, if one child's like-animal is not removed and his/hers dislike-animal is removed, he/she will be happy. So the administrator wants to know which animals he should remove to make maximum number of happy children.

Input

The input file contains multiple test cases, for each case, the first line contains three integers N <= 100, M <= 100 and P <= 500.
Next P lines, each line contains a child's like-animal and dislike-animal, C for cat and D for dog. (See sample for details)

Output

For each case, output a single integer: the maximum number of happy children.

Sample

Inputcopy	Outputcopy
1 1 2 C1 D1 D1 C1 1 2 4 C1 D1 C1 D1 C1 D2 D2 C1	1 3

Inputcopy

Outputcopy

1 1 2 C1 D1 D1 C1 1 2 4 C1 D1 C1 D1 C1 D2 D2 C1

1 3

Hint

Case 2: Remove D1 and D2, that makes child 1, 2, 3 happy.

Sponsor

二、思路：

求儿童的最大独立集

最大独立集 = 顶点数 - 最大匹配数（二分匹配匈牙利）

三、代码：

#include<iostream>
#include<string.h>
#include<stdlib.h>
using namespace std;
int n, m, p;
char a[1005][12], b[1005][12];
int map[1005][520], book[1005], girl[1005];

int dfs(int u)//匈牙利算法，求出最大匹配数量
{
	int i;

	for (i = 0; i < p; i++)
	{
		if (book[i] == 0 && map[u][i] == 1)
		{
			book[i] = 1;

			if (girl[i] == 0 || dfs(girl[i]))
			{
				girl[i] = u;

				return 1;
			}
		}
	}
	return 0;
}

int main()
{
	int i, j, sum;

	while (~scanf("%d %d %d", &n, &m, &p))
	{
	
		sum = 0;
		memset(girl, 0, sizeof(girl));
		memset(map, 0, sizeof(map));

		for (i = 0; i < p; i++)
		{
			cin >> a[i] >> b[i];
		}

		for (i = 0; i < p; i++)
		{
			for (j = i + 1; j < p; j++)
			{
				if (strcmp(a[i], b[j]) == 0 || strcmp(a[j], b[i]) == 0)
				{
					map[i][j] = 1;
					map[j][i] = 1;//建图
				}
			}
		}
		for (i = 0; i < p; i++)
		{
			memset(book, 0, sizeof(book));

			if (dfs(i))
				sum++;
		}
		cout << p - sum / 2 << endl;//图是重复的，所以求出的最大匹配数除以二
	}
	return 0;
}