Card Game Cheater HDU1528

二分图最大匹配问题

扑克题还是用map比较方便

#include<bits/stdc++.h>
using namespace std;
#define MAXI 52
int yd[MAXI][];
int xw[MAXI][];
int used[MAXI];
int vis[MAXI];
int n,m;

map<char,int>mm;

bool judge(int a,int b)
{
   if( mm[xw[a][]]>mm[ yd[b][] ] )
    return true;
   else if(mm[xw[a][]]==mm[ yd[b][] ])
    return mm[xw[a][]]>mm[ yd[b][] ];
   else
    return false;
}

bool dfs(int  x)//x指夏娃数组下标
{
    for(int j=;j<=n;j++)//j是亚当的
    {
        if(judge(x,j)&&!used[j])
        {
            used[j]=;
            if(!vis[j]||dfs(vis[j]) )
              {
                  vis[j]=x;
                  return true;
              }
        }
    }
    return false;
}

int find1(void)
{    int ans=;
     memset(vis,,sizeof(vis));
     for(int i=;i<=n;i++)//这里的i指的是夏娃的
       {
           memset(used,,sizeof(used));
           if(dfs(i))ans++;
       }
       return ans;
}

int main()
{
  int cas;
  cin>>cas;
  for(char i='';i<='';i++)
      mm[i]=i-'';
  mm['T']=;
  mm['J']=;
  mm['Q']=;
  mm['K']=;
  mm['A']=;
  mm['C']=;
  mm['D']=;
  mm['S']=;
  mm['H']=;
  int first=;
  while(cas--)
  {
     scanf("%d",&n);
     char s[];
     for(int i=;i<=n;i++)
     {
         scanf("%s",s);
         yd[i][]=s[];
         yd[i][]=s[];
     }
      for(int i=;i<=n;i++)
      {
          scanf("%s",s);
          xw[i][]=s[];
          xw[i][]=s[];
      }
      printf("%d\n",find1());
  }
  return ;
}