HDU1068 最大独立集
题意:按一男一女配对,最后求不能配对的,即最大独立集,等于顶点数-最大匹配
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#include<set>
#include<stack>
#define cl(a,b) memset(a,b,sizeof(a));
#define LL long long
#define P pair<int,int>
#define X first
#define Y second
#define pb push_back
using namespace std;
const int maxn=1550;
const int inf=9999999;
const int mod=100007;
vector<int> G[maxn];
bool vis[maxn];
int matching[maxn];
int num_left;
bool dfs(int u){
int N=G[u].size();
for(int i=0;i<N;i++){
int v=G[u][i];
if(vis[v])continue;
vis[v]=true;
if(matching[v]==-1||dfs(matching[v])){
matching[v]=u;
return true;
}
}
return false;
}
int hungar(){
int ans=0;
cl(matching,-1);
for(int i=0;i<num_left;i++){
cl(vis,false);
if(dfs(i))ans++;
}
return num_left-ans/2;//n-匹配数
}
int main(){
int n;
while(~scanf("%d",&n)){
for(int i=0;i<=n;i++)G[i].clear();
for(int i=0;i<n;i++){
int u,v,k;
scanf("%d: (%d)",&u,&k);
while(k--){
scanf("%d",&v);
G[u].pb(v);
}
}
num_left=n;//这里是左右全部算了,所以ans除2
printf("%d\n",hungar());
}
return 0;
}