HDU1498 - 50 years, 50 colors

行列匹配 最小点覆盖

#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <vector>
#include <algorithm>
#include <stack>
#include <cmath>
#include <queue>
#include <set>
#define maxn 1010
#define eps (1e-7)
typedef long long ll;
using namespace std;
int uN, vN;//u,v数目
int edge[maxn][maxn];
int linker[maxn];
bool used[maxn];
struct node {
    int u, v;
}pt[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 mat[maxn][maxn];
int main() {
    int n, k;
    while (scanf("%d%d", &n, &k) != EOF) {
        set<int> S;
        if (n == 0 && k == 0) break;
        for (int i = 0; i < n; ++ i) {
            for (int j = 0; j < n; ++ j) {
                scanf("%d", &mat[i][j]);
                S.insert(mat[i][j]);
            }
        }
        vector<int> res;
        uN = vN = n;
        for (set<int>::iterator it = S.begin(); it != S.end(); ++ it) {
            memset(edge, 0, sizeof(edge));
            int col = *it;
            for (int i = 0; i < n; ++ i) {
                for (int j = 0; j < n; ++ j) {
                    if (mat[i][j] == col) {
                        edge[i][j] = 1;
                    }
                }
            }
            if (max_match() > k) res.push_back(col);
        }
        if (res.empty()) puts("-1");
        else {
            cout << res[0];
            for (int i = 1; i < res.size(); ++ i)
                cout << " " << res[i];
            cout << endl;
        }
    }
}