HDU 3829 Cat VS Dog

Cat VS Dog

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 125536/65536 K (Java/Others)
Total Submission(s): 3171    Accepted Submission(s): 1109

Problem Description

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 Input

  
  

   
   1 1 2
C1 D1
D1 C1

1 2 4
C1 D1
C1 D1
C1 D2
D2 C1
  
  

 

Sample Output

  
  

   
   1
3


   
   

    
    

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

 

Source

2011 Multi-University Training Contest 1 - Host by HNU

 

Recommend

xubiao   |   We have carefully selected several similar problems for you:   3828  3830  3831  3832  3835 

（来自网上）题目描述：动物园有N只猫，M只狗，P个小孩。每个小孩都有自己喜欢的动物和讨厌的动物，如果他喜欢狗，那么就讨厌猫，
如果他讨厌猫，那么他就喜欢狗。某个小孩能开心，当且仅当他喜欢的动物留在动物园和讨厌的动物不在动物园里面。
现让管理员通过带走某些动物，问最多能使多少个孩子开心。
解题思路：题目有一个关键点，孩子喜欢猫，必然不喜欢狗，反之。 即猫和猫之间，狗和狗之间一定不存在矛盾关系，符合二分图的概念。
如何建立二分图：
若甲小孩喜欢的动物与乙小孩讨厌的动物一样，或者甲小孩讨厌的动物与乙小孩喜欢的动物一样，那甲乙之间就存在着排斥关系，则他们之间连接一条边。
建立完二分图之后，相当于求二分图的最大独立集 = 顶点数 - 最大匹配数。

所以这是一个二分图的题目，需要直接套用模板。

二分图/网络流里面有好多固定的模型，这些东西直接想挺难的，直接去记下来比较方便，了解清楚了以后再想这题做法的话会比较好想（by jk)

#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<cstring>
using namespace std;
 
const int MAXN=1505;//这个值要超过两边个数的较大者，因为有linker
int linker[MAXN];
bool used[MAXN];
vector<int>map[MAXN];
int uN;
bool dfs(int u)
{
    for(int i=0;i<map[u].size();i++)
    {
        if(!used[map[u][i]])
        {
            used[map[u][i]]=true;
            if(linker[map[u][i]]==-1||dfs(linker[map[u][i]]))
            {
                linker[map[u][i]]=u;
                return true;
            }
        }
    }
    return false;
}
int hungary()
{
    int u;
    int res=0;
    memset(linker,-1,sizeof(linker));
    for(u=0;u<uN;u++)
    {
        memset(used,false,sizeof(used));
        if(dfs(u)) res++;
    }
    return res;
}

int main()
{
	int n,m,p;
	while(cin >> n >> m >> p)
	{
		string like[510];
		string dislike[510];
		
		for(int i=0;i<MAXN;i++)map[i].clear();
		
		for(int i=0;i<p;i++)
			cin >> like[i] >> dislike[i];
		uN = p;
		for(int i = 0;i < p;i++)
		{
			for(int j = i+1;j<p;j++)
			{
				if((like[i] == dislike[j])||(like[j]==dislike[i]))
				{
					map[i].push_back(j);
					map[j].push_back(i);
				}
			} 
		}
		printf("%d\n",p-hungary()/2);
	}
	return 0;
}