hdu3768最大独立集

题目自己读就好了；

/*****************************************
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;
const int maxn = 550;
int uN,vN;
int g[maxn][maxn];
int link[maxn];
bool vis[maxn];
bool dfs(int u){
	for (int v = 0;v < uN;v++){
		if (g[u][v] && !vis[v]){
			vis[v] = true;
			if (link[v] == -1 || dfs(link[v])){
				link[v] = u;
				link[u] = v;
				return true;
			}
		}
	}
	return false;
}

inline int Hungary(){
	int ret = 0;
	MEM(link, -1);
	for (int u = 0;u < uN;u++){
		if (link[u] < 0){
			MEM(vis, false);
			if (dfs(u)) ret++;
		}
	}
	return ret;
}
char str[maxn][2][maxn];
int main()
{	
	// ios::sync_with_stdio(false);
	// freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	int T;
	int c,d,v;
	cin >> T;
	while(T--){
		scanf("%d%d%d",&c,&d,&v);
		for (int i = 0;i < v;i++)
			scanf("%s%s",str[i][0],str[i][1]);
		MEM(g, 0);
	for (int i = 0;i < v;i++){
		for (int j = 0;j < v;j++){
			if (i == j) continue;
			if (strcmp(str[i][0],str[j][1]) == 0 || strcmp(str[i][1],str[j][0]) == 0) g[i][j] = 1;
		}
	}
	uN = vN = v;
	// cout << Hungary() << endl;
	printf("%d\n",v - Hungary());
	}
	return 0;
}