GDUT专题学习3- N - Cat VS Dog

N - Cat VS Dog

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

Hint

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

题意

        动物园有N只猫和M只狗，今天有P个孩子参观动物园，每个孩子都有一个喜欢的动物和一个不喜欢的动物，如果孩子喜欢的动物是猫，那么他/她的不喜欢的动物一定是狗，反之亦然。
现在动物园管理员正在移走一些动物，如果一个孩子喜欢的动物没有被移走，而他/她不喜欢的动物被移走，他/她会很高兴。所以管理员想知道他应该移除哪些动物来制造最大数量的快乐孩子。

思路

如果一个小朋友喜欢的动物是另一个小朋友讨厌的就只能有一个小朋友高兴，所以将这样的小朋友进行匹配，用匈牙利算法找出最大匹配数，用总数减去匹配数的一半即为答案。

代码

#include<iostream>
#include<cstring>
#include<bits/stdc++.h>
#define Pa pair<string,string>
#define fi first
#define se second
using namespace std;
const int N=505;
int n,m,k,ans;
int h[N],vis[N],match[N],a[N][N];
bool dfs(int u){
	for(int i=1;i<=k;i++){
		if(vis[i])continue;
		if(!a[u][i])continue;
		vis[i]=1;
		if(!match[i]||dfs(match[i])){
			match[i]=u;
			return 1;
		}
	}
	return 0;
}
Pa s[N];
int main(){

	string s1,s2;
	while(cin>>n>>m>>k){
		memset(a,0,sizeof(a));
		memset(match,0,sizeof(match));
		ans=0;
		for(int i=1;i<=k;i++){
			cin>>s[i].fi>>s[i].se;
			for(int j=1;j<=i;j++){
				if(s[i].fi==s[j].se||s[i].se==s[j].fi){
					a[i][j]=a[j][i]=1;
				}
			}
		}
		for(int i=1;i<=k;i++){
			memset(vis,0,sizeof(vis));
			if(dfs(i))ans++;
		}
		cout<<k-ans/2<<endl;
	}
	
	return 0;
}