hdu2768-Cat vs. Dog：图论：二分匹配

Cat vs. Dog

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1602    Accepted Submission(s): 606

Problem Description

The latest reality show has hit the TV: ``Cat vs. Dog''. In this show, a bunch of cats and dogs compete for the very prestigious Best Pet Ever title. In each episode, the cats and dogs get to show themselves off, after which the viewers vote on which pets should stay and which should be forced to leave the show.

Each viewer gets to cast a vote on two things: one pet which should be kept on the show, and one pet which should be thrown out. Also, based on the universal fact that everyone is either a cat lover (i.e. a dog hater) or a dog lover (i.e. a cat hater), it has been decided that each vote must name exactly one cat and exactly one dog.

Ingenious as they are, the producers have decided to use an advancement procedure which guarantees that as many viewers as possible will continue watching the show: the pets that get to stay will be chosen so as to maximize the number of viewers who get both their opinions satisfied. Write a program to calculate this maximum number of viewers.

 

Input

On the first line one positive number: the number of testcases, at most 100. After that per testcase:

* One line with three integers c, d, v (1 ≤ c, d ≤ 100 and 0 ≤ v ≤ 500): the number of cats, dogs, and voters.
* v lines with two pet identifiers each. The first is the pet that this voter wants to keep, the second is the pet that this voter wants to throw out. A pet identifier starts with one of the characters `C' or `D', indicating whether the pet is a cat or dog, respectively. The remaining part of the identifier is an integer giving the number of the pet (between 1 and c for cats, and between 1 and d for dogs). So for instance, ``D42'' indicates dog number 42.

 

Output

Per testcase:

* One line with the maximum possible number of satisfied voters for the show.

 

Sample Input

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

 

Sample Output

1 3

 

Source

NWERC 2008

---

算法：将喜欢猫和喜欢狗的人分开，就形成了一个二分图，这样喜欢猫（狗）的人一定不会冲突的，然后扫描一次，将互相矛盾的人连一条边。

二分图的最大独立集就是答案。由已知定理有：二分图最大独立集=顶点数-二分图最大匹配。求二分图最大匹配即可。

 

 

const int MAXN = 510;
int uN,vN;//u,v的数目，使用前面必须赋值
int g[MAXN][MAXN];//邻接矩阵
int linker[MAXN];
bool used[MAXN];
#include <memory.h>
bool dfs(int u)
{
    for(int v = 0; v < vN; v++)
        if(g[u][v] && !used[v])
        {
            used[v] = true;
            if(linker[v] == -1 || dfs(linker[v]))
            {
                linker[v] = u;
                return true;
            }
        }
    return false;
}
int hungary()
{
    int res = 0;
    memset(linker,-1,sizeof(linker));
    for(int u = 0; u < uN; u++)
    {
        memset(used,false,sizeof(used));
        if(dfs(u))res++;
    }
    return res;
}

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;


int getint(char s[])
{
    int ans=0;
    for(int i=0; i<strlen(s); i++)
    {
        ans=ans*10+s[i]-'0';
    }
    return ans;
}

typedef pair<int,int> CPair;

CPair upair[510],vpair[510];
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif // ONLINE_JUDGE
    int T;
    cin>>T;
    while(T--)
    {
        memset(g,0,sizeof g);
        int nc,nd,n;
        uN=vN=0;
        scanf("%d%d%d",&nc,&nd,&n);
        for(int i=0; i<n; i++) // 人的数量
        {
            char s1[20],s2[20];
            scanf("%s%s",s1,s2); // C1 D1
            int ci=getint(s1+1),di=getint(s2+1);
            if(s1[0]=='C')
            {
                // 放到第一个集合
                upair[uN++]=CPair(ci,di);
            }
            else
            {
                vpair[vN++]=CPair(ci,di);
            }
        }
        // 构图
        for(int i=0;i<uN;i++)
            for(int j=0;j<vN;j++)
            {
                // 矛盾的话就连一条边
                if(upair[i].first==vpair[j].second || upair[i].second==vpair[j].first)
                    g[i][j]=1;
            }

        int ans=uN+vN-hungary();
        printf("%d
",ans);
    }
    return 0;
}