M - Jamie's Contact Groups POJ - 2289
题意:给定朋友们可能属于的组的编号,让你求分成组的最多的联系人最少。
分析:题不是很难补一个模板,二分枚举最大匹配数,找到最小的那个即可。
#include <iostream>
#include <cstdio>
#include <stack>
#include <cmath>
#include <set>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
const int maxn = 1510;
int un, vn, g[maxn][maxn], linker[maxn][maxn];
bool used[maxn];
int num[maxn], mid, n, m;
string str;
bool dfs(int u)
{
for(int v = 0; v < m; v++)
if(g[u][v] && !used[v])
{
used[v] = 1;
if(linker[v][0] < mid)
{
linker[v][++linker[v][0]] = u;
return true;
}
for(int i = 1; i <= mid; i++)
if(dfs(linker[v][i])){
linker[v][i] = u;
return true;
}
}
return false;
}
int hungry()
{
int res = 0;
for(int i = 0; i < m; i++) linker[i][0] = 0;
for(int u = 0; u < n; u++){
memset(used, 0, sizeof(used));
if(dfs(u)) res++;
}
return res;
}
int main()
{
while(~scanf("%d%d", &n, &m) && n + m)
{
memset(g, 0, sizeof(g));
for(int i = 0; i < n; i++)
{
cin >> str;
while(getchar() != '\n')
{
int a;
scanf("%d", &a);
g[i][a] = 1;
}
}
int l = 1, r = n, ans;
while(l <= r)
{
mid = (l + r) / 2;
if(hungry() == n) ans = mid, r = mid - 1;
else l = mid + 1;
}
printf("%d\n", ans);
}
return 0;
}