#include <cstdio>
#include <cstring>
#define m(a,b) memset(a,b,sizeof a)
using namespace std;
typedef long long ll;
const int N=5010;
const int M=50100;
const int INF=0x3f3f3f3f;
int tot;
int head[N],mt[N];
bool vis[N];
char a[N][3];
struct Edge{int to,nex;}edge[M];
void add(int from,int to)
{
edge[++tot]=(Edge){to,head[from]};head[from]=tot;
}
int alter(char ch)
{
if(ch>='2'&&ch<='9')
return ch-'0';
if(ch=='T')return 10;
if(ch=='J')return 11;
if(ch=='Q')return 12;
if(ch=='K')return 13;
if(ch=='A')return 14;
if(ch=='C')return 1;
if(ch=='D')return 2;
if(ch=='S')return 3;
if(ch=='H')return 4;
}
bool find_path(int x)
{
for(int i=head[x];i;i=edge[i].nex)
{
int y=edge[i].to;
if(!vis[y])
{
vis[y]=1;
if(!mt[y]||find_path(mt[y]))
{
mt[y]=x;
return 1;
}
}
}
return 0;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
m(head,0);
m(mt,0);
tot=1;
char str[5];
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%s",a[i]);
for(int j=1;j<=n;j++)
{
scanf("%s",str);
for(int i=1;i<=n;i++)
{
if(alter(str[0])>alter(a[i][0])||str[0]==a[i][0]&&alter(str[1])>alter(a[i][1]))
add(j,i);
}
}
int ans=0;
for(int j=1;j<=n;j++)
{
m(vis,0);
if(find_path(j))
ans++;
}
printf("%d\n",ans);
}
}
HDU-1528-Card Game Cheater(类似田忌赛马。最大匹配)
猜你喜欢
转载自blog.csdn.net/qq_42576687/article/details/87900747
今日推荐
周排行