Dining

Description

Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.

Farmer John has cooked fabulous meals for his cows, but he forgot to check his menu against their preferences. Although he might not be able to stuff everybody, he wants to give a complete meal of both food and drink to as many cows as possible.

Farmer John has cooked F (1 ≤ F ≤ 100) types of foods and prepared D (1 ≤ D ≤ 100) types of drinks. Each of his N (1 ≤ N ≤ 100) cows has decided whether she is willing to eat a particular food or drink a particular drink. Farmer John must assign a food type and a drink type to each cow to maximize the number of cows who get both.

Each dish or drink can only be consumed by one cow (i.e., once food type 2 is assigned to a cow, no other cow can be assigned food type 2).

Input

Line 1: Three space-separated integers: N, F, and D 
Lines 2..N+1: Each line i starts with a two integers F_i and D_i, the number of dishes that cow i likes and the number of drinks that cow i likes. The next F_i integers denote the dishes that cow i will eat, and the D_i integers following that denote the drinks that cow i will drink.

Output

Line 1: A single integer that is the maximum number of cows that can be fed both food and drink that conform to their wishes

Sample Input

4 3 3
2 2 1 2 3 1
2 2 2 3 1 2
2 2 1 3 1 2
2 1 1 3 3

Sample Output

3

Hint

One way to satisfy three cows is: 
Cow 1: no meal 
Cow 2: Food #2, Drink #2 
Cow 3: Food #1, Drink #1 
Cow 4: Food #3, Drink #3 
The pigeon-hole principle tells us we can do no better since there are only three kinds of food or drink. Other test data sets are more challenging, of course.

Source

USACO 2007 Open Gold

分析

拆点+网络流最大流

code

 1 #include<cstdio>
 2 #include<algorithm>
 3
 4 using namespace std;
 5
 6 const int INF = 1e9;
 7 const int N = 10010;
 8
 9 struct Edge{
10     int to,nxt,c;
11 }e[N];
12 int head[N],dis[N],cur[N],q[500100];
13 int tot = 1,L,R,S,T;
14
15 inline char nc() {
16     static char buf[100000],*p1 = buf,*p2 = buf;
17     return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
18 }
19 inline int read() {
20     int x = 0,f = 1;char ch = nc();
21     for (; ch<‘0‘||ch>‘9‘; ch = nc()) if (ch==‘-‘) f = -1;
22     for (; ch>=‘0‘&&ch<=‘9‘; ch = nc()) x = x * 10 + ch - ‘0‘;
23     return x * f;
24 }
25 inline void add_edge(int u,int v,int w) {
26     e[++tot].to = v,e[tot].c = w,e[tot].nxt = head[u],head[u] = tot;
27     e[++tot].to = u,e[tot].c = 0,e[tot].nxt = head[v],head[v] = tot;
28 }
29 bool bfs() {
30     for (int i=0; i<=T; ++i) {
31         cur[i] = head[i];dis[i] = -1;
32     }
33     L = 1;R = 0;
34     q[++R] = S;dis[S] = 0;
35     while (L <= R) {
36         int u = q[L++];
37         for (int i=head[u]; i; i=e[i].nxt) {
38             int v = e[i].to,c = e[i].c;
39             if (dis[v]==-1 && c>0) {
40                 dis[v] = dis[u] + 1;
41                 q[++R] = v;
42                 if (v==T) return true;
43             }
44         }
45     }
46     return false;
47 }
48 int dfs(int u,int flow) {
49     if (u==T) return flow;
50     int used = 0;
51     for (int &i=cur[u]; i; i=e[i].nxt) {
52         int v = e[i].to,c = e[i].c;
53         if (dis[v]==dis[u]+1 && c>0) {
54             int tmp = dfs(v,min(c,flow-used));
55             if (tmp > 0) {
56                 e[i].c -= tmp;e[i^1].c += tmp;
57                 used += tmp;
58                 if (used==flow) break;
59             }
60         }
61     }
62     if (used!=flow) dis[u] = -1;
63     return used;
64 }
65 inline int dinic() {
66     int ans = 0;
67     while (bfs()) ans += dfs(S,INF);
68     return ans;
69 }
70 int main() {
71     int n = read(),F = read(),D = read();
72     S = 0,T = n+n+F+D+1;
73     for (int i=1; i<=n; ++i) {
74         int f = read(),d = read();
75         for (int a,j=1; j<=f; ++j)
76             a = read(),add_edge(a+n+n,i,1);
77         for (int a,j=1; j<=d; ++j)
78             a = read(),add_edge(i+n,a+n+n+F,1);
79     }
80     for (int i=1; i<=n; ++i) add_edge(i,i+n,1);
81     for (int i=1; i<=F; ++i) add_edge(S,i+n+n,1);
82     for (int i=1; i<=D; ++i) add_edge(i+n+n+F,T,1);
83     printf("%d",dinic());
84     return 0;
85 }