hdu498二分图(Hungary)

思路：题目读完后就知道了，枚举每个数字，然后相同数字的建边，Hungary() < k,vec.push_back(i);

题目链接

/*****************************************
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;
int gg[110][110];
int a[110][110];
int vis[110];
int link[110];
int k,n;

bool Search_P(int u){
	for (int i = 0;i < n;++i){
		if (!vis[i] && gg[u][i]){
			vis[i] = 1;
			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 = 0;i < n;++i){
		for (int j = 0;j < n;++j)
			vis[j] = 0;
		// MEM(vis, 0);
		if (Search_P(i)) ret++;
	}
	return ret;
}
int main()
{	
	// ios::sync_with_stdio(false);
	// freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	while(~scanf("%d%d",&n,&k)){
		if (n == 0 && k == 0) break;
		for (int i = 0;i < n;++i)
			for (int j = 0;j < n;++j)
				scanf("%d",&a[i][j]);
			vector<int> vec;
		for (int i = 1;i <= 50;++i){
			MEM(gg, 0);
			for (int j = 0;j < n;++j)
				for (int k = 0;k < n;++k){
					if (a[j][k] == i){
						gg[j][k] = 1;
					}
				}
			int ans = Hungary();
			if (ans > k) vec.push_back(i);
		}
		// int size = vec.size();
		if (vec.size() == 0) printf("-1\n");
		else {
			for (int i = 0;i < vec.size();++i){
				printf("%d%c",vec[i],i == vec.size() - 1?'\n':' ');
			}
		}
	}
	return 0;
}