这两天被线段树懒惰标记搞得晕头转向了。。回归图论,继续刷水题
//184K 16MS
#include <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
int vnum;
const int maxvnum = 400;
vector<int> G[maxvnum+5];
int match[maxvnum+5];
bool used[maxvnum+5];
inline void add_edge(int u, int v){
G[u].push_back(v);
G[v].push_back(u);
}
bool DFS(int v){
used[v] = true;
for(int i=0; i<G[v].size(); i++){
int u = G[v][i], w = match[u];
if(w < 0 || (!used[w] && DFS(w))){
match[v] = u;
match[u] = v;
return true;
}
}
return false;
}
int bi_match(){
int res = 0;
memset(match, -1, sizeof(match));
for(int v=0; v<vnum; v++){
if(match[v] < 0){
memset(used, 0, sizeof(used));
if(DFS(v)) res++;
}
}
return res;
}
int main(){
int n, m;
while(~scanf("%d%d", &n, &m)){
for(int i=0; i<maxvnum+5; i++) G[i].clear();
vnum = n + m;
for(int i=1; i<=n; i++){
int k; scanf("%d", &k);
for(int j=1; j<=k; j++){
int t; scanf("%d", &t);
add_edge(i, n+t);
}
}
printf("%d\n", bi_match());
}
return 0;
}