hdu1258简单二分图匹配

/*****************************************
Author      :Crazy_AC(JamesQi)
Time        :2015
File Name   :
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
#define MEM(a,b) memset(a,b,sizeof a)
#define pk push_back
template<class T> inline T Get_Max(const T&a,const T&b){return a < b?b:a;}
template<class T> inline T Get_Min(const T&a,const T&b){return a < b?a:b;}
typedef long long ll;
typedef pair<int,int> ii;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
char str[60][2];
struct point{
	int num;
	char type;
}card[60];
int n;
bool gg[60][60];
int link[60];
bool vis[60];
bool Judge(int x,int y){
	if (card[x].type == 'H' && card[y].type != 'H') 
		return true;
	else if (card[x].type == 'S' && (card[y].type == 'C' || card[y].type == 'D'))
		return true;
	else if (card[x].type == 'D' && card[y].type == 'C')
		return true;
	return false;
}

bool Search_P(int u){
	for (int i = 1;i <= n;i++){
		if (gg[u][i] && !vis[i]){
			vis[i] = true;
			if (link[i] == -1 || Search_P(link[i])){
				link[i] = u;
				return true;
			}
		}
	}
	return false;
}
inline int Hungary(){
	int ret = 0;
	MEM(link, -1);
	for (int i = 1 + n;i <= 2 * n;i++){
		MEM(vis, false);
		if (Search_P(i)) ret++;
	}
	return ret;
}

int main()
{	
	// ios::sync_with_stdio(false);
	// freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	int T;
	scanf("%d",&T);
	while(T--){
		MEM(gg, false);
		scanf("%d",&n);
		getchar();
		for (int i = 1;i <= n;i++){
			scanf("%s",str[i]);
			if (str[i][0] == 'T')
				card[i].num = 10;
			else if (str[i][0] == 'J')
				card[i].num = 11;
			else if (str[i][0] == 'Q')
				card[i].num = 12;
			else if (str[i][0] == 'K')
				card[i].num = 13;
			else if (str[i][0] == 'A')
				card[i].num = 14;
			else card[i].num = str[i][0] - '0';
			card[i].type = str[i][1];
		}
		getchar();
		for (int i = n + 1;i <= n * 2;i++){
			scanf("%s",str[i]);
			// cout << str[i] << ' ';
			if (str[i][0] == 'T')
				card[i].num = 10;
			else if (str[i][0] == 'J')
				card[i].num = 11;
			else if (str[i][0] == 'Q')
				card[i].num = 12;
			else if (str[i][0] == 'K')
				card[i].num = 13;
			else if (str[i][0] == 'A')
				card[i].num = 14;
			else card[i].num = str[i][0] - '0';
			card[i].type = str[i][1];
			for (int j = 1;j <= n;j++){
				if (card[i].num > card[j].num)
					gg[i][j] = true;
				else if (card[i].num == card[j].num && (Judge(i,j)))
					gg[i][j] = true;
				// cout << gg[i][j] << ' ';
			}	
			// cout << '\n';
		}
		int ans = Hungary();
		printf("%d\n",ans);
	}
	return 0;
}