hdu3829

题解：

对于每一个孩子裂点+建边

如果i孩子讨厌的和j孩子喜欢的相同，那么建边

然后跑最大独立集

代码：

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int N=;
int fi[N],num,s1[N],s2[N],match[N],zz[N*N],ne[N*N],n,f[N];
void jb(int x,int y)
{
    ne[++num]=fi[x];
    fi[x]=num;
    zz[num]=y;
}
int dfs(int x)
{
    for (int i=fi[x];i;i=ne[i])
     if (!f[zz[i]])
      {
          f[zz[i]]=;
          if (!match[zz[i]]||dfs(match[zz[i]]))
           {
               match[zz[i]]=x;
               return ;
           }
      }
    return ;
}
int read()
{
    int k=,x=;char c;
    for (c=getchar();c!='C'&&c!='D';c=getchar());
    if (c=='C')k+=n;
    scanf("%d",&x);
    return k+x;
}
int main()
{
    while (~scanf("%d%d%d",&n,&n,&n))
     {
         memset(fi,,sizeof fi);
         memset(match,,sizeof match);
        num=;
        for (int i=;i<=n;i++)s1[i]=read(),s2[i]=read();
        for (int i=;i<=n;i++)
         for (int j=;j<=n;j++)
          if (s1[i]==s2[j]||s2[i]==s1[j])jb(i,j);
        int ans=;
        for (int i=;i<=n;i++)
         {
             memset(f,,sizeof f);
             ans+=dfs(i);
         }
        printf("%d\n",n-ans/);
     }
}