HDU1528 - Card Game Cheater

最大匹配

#include <cstring>
#include <iostream>
#include <cstdlib>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#define INF (int)(1e9)
#define maxn 1010
using namespace std;
typedef long long ll;
int uN, vN;//u,v数目
int edge[maxn][maxn];
int linker[maxn];
bool used[maxn];
bool dfs(int u) { //从左边开始找增广路径
    int v;
    for(v = 0; v < vN; ++ v) {
        if(edge[u][v] && !used[v]) {
            used[v] = true;
            if(linker[v] == -1 || dfs(linker[v])) {
                //找增广路，反向
                linker[v] = u;
                return true;
            }
        }
    }
    return false;
}
int max_match() {
    int res=0;
    int u;
    memset(linker,-1,sizeof(linker));
    for(u = 0; u < uN; u++) {
        memset(used, 0, sizeof(used));
        if(dfs(u)) res ++;
    }
    return res;
}
int value[maxn];
void doit() {
    value['2'] = 1;
    value['3'] = 2;
    value['4'] = 3;
    value['5'] = 4;
    value['6'] = 5;
    value['7'] = 6;
    value['8'] = 7;
    value['9'] = 8;
    value['T'] = 9;
    value['J'] = 10;
    value['Q'] = 11;
    value['K'] = 12;
    value['A'] = 13;
    value['C'] = 1;
    value['D'] = 2;
    value['S'] = 3;
    value['H'] = 4;

}
bool cmp(string a, string b) {
    if (value[a[0]] != value[b[0]]) return value[a[0]] > value[b[0]];
    else return value[a[1]] > value[b[1]];
}
string s1[maxn], s2[maxn];
int main() {
    int t;
    doit();
    scanf("%d", &t);
    while (t --) {
        memset(edge, 0, sizeof(edge));
        int n;
        scanf("%d", &n);
        for (int i = 0; i < n; ++ i) {
            cin >> s1[i];
        }
        for (int i = 0; i < n; ++ i) {
            cin >> s2[i];
        }
        for (int i = 0; i < n; ++ i) {
            for (int j = 0; j < n; ++ j) {
                if (cmp(s2[i], s1[j])) {
                    edge[i][j] = 1;
                }
            }
        }
        uN = vN = n;
        cout << max_match() << endl;
    }
}