poj_1274

/ *
 * Maximum flow model
 * Built diagram, src-> cow-> stall-> des, all edges of the flow 1 ans = maximum flow
* /
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;

#define MAXN	2000
#define MAXM	20000
#define INF		0x7fffffff

struct Edge {
	int v, w, next;
}edge[MAXM];

int e_cnt, head[MAXN], cur[MAXN], pre[MAXN], dis[MAXN], gap[MAXN];

void insert_arc(int u, int v, int w)
{
	edge[e_cnt].w = w;	edge[e_cnt].v = v;
	edge[e_cnt].next = head[u];	head[u] = e_cnt ++;
	swap(u, v);
	edge[e_cnt].w = 0;	edge[e_cnt].v = v;
	edge[e_cnt].next = head[u];	head[u] = e_cnt ++;
}

void re_bfs(int des, int vn)
{
	int u, v;
	queue<int> q;
	memset(gap, 0, sizeof(gap));
	fill(dis, dis+vn, vn);
	dis[des] = 0;	gap[0] = 1;
	q.push(des);
	while( !q.empty() ) {
		u = q.front(); q.pop();
		for(int i = head[u]; -1 != i; i = edge[i].next) {
			v = edge[i].v;
			if( edge[i].w || vn > dis[v] ) {
				continue;
			}
			q.push(v); gap[ dis[v] = dis[u]+1 ] ++;
		}
	}
}

int i_sap(int src, int des, int vn)
{
	int u(src), v, min_dis, max_flow(0), path_flow(INF);
	re_bfs(des, vn);	pre[u] = u;
	for(int i = 0; i <= vn; i ++) {
		cur[i] = head[i];
	}
	while( dis[src] < vn ) {
loop:
		for(int &i = cur[u]; -1 != i; i = edge[i].next) {
			v = edge[i].v;
			if( !edge[i].w || dis[u] != dis[v]+1 ) {
				continue;
			}
			path_flow = min(path_flow, edge[i].w);
			pre[v] = u; u = v;
			if( v == des ) {
				for(u = pre[u]; v != src; v = u, u = pre[u]) {
					edge[cur[u]].w -= path_flow;
					edge[cur[u]^0x1].w += path_flow;
				}
				max_flow += path_flow; path_flow = INF;
			}
			goto loop;
		}
		min_dis = vn;
		for(int i = head[u]; -1 != i; i = edge[i].next) {
			v = edge[i].v;
			if( edge[i].w && min_dis > dis[v] ) {
				min_dis = dis[v]; cur[u] = i;
			}
		}
		if( !gap[ --dis[u] ] ) {
			break;
		}
		gap[ dis[u] = min_dis+1 ] ++;
		u = pre[u];
	}
	return max_flow;
}

int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGE
	freopen("test.in", "r", stdin);
#endif
	int cow_cnt, stall_cnt, cnt, val, src, des;
	while( ~scanf("%d %d", &cow_cnt, &stall_cnt) ) {
		src = cow_cnt+stall_cnt+1;	des = src+1;
		e_cnt = 0; memset(head, -1, sizeof(head));
		for(int i = 1; i <= stall_cnt; i ++) {
			insert_arc(i+cow_cnt, des, 1);
		}
		for(int i = 1; i <= cow_cnt; i ++) {
			scanf("%d", &cnt);
			insert_arc(src, i, 1);
			for(int j = 0; j < cnt; j ++) {
				scanf("%d", &val);
				insert_arc(i, val+cow_cnt, 1);
			}
		}
		printf("%d\n", i_sap(src, des, des+1));
	}
	return 0;
}