Dining

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 17414		Accepted: 7728

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

思路：最大流+拆点

F->N->N->D

代码实现：

 1 #include<cstdio>
 2 #include<cstring>
 3 const int maxn=500;
 4 const int maxm=1e6;
 5 int n,f,d,s,t,ans;
 6 int a,b,c;
 7 inline int min_(int x,int y){return x<y?x:y;}
 8 int h[maxn],hs=1;
 9 int e_s[maxm],e_w[maxm],e_n[maxm];
10 void add(int q,int z){
11     ++hs,e_s[hs]=z,e_w[hs]=1,e_n[hs]=h[q],h[q]=hs;
12     ++hs,e_s[hs]=q,e_n[hs]=h[z],h[z]=hs;
13 }
14 int de[maxn],q[maxn],head,tail;
15 void bfs(){
16     memset(de,0,sizeof(de));
17     head=tail=0;
18     de[s]=1,q[head++]=s;
19     while(head>tail){
20         a=q[tail++];
21         for(int i=h[a];i;i=e_n[i])
22         if(!de[e_s[i]]&&e_w[i]){
23             de[e_s[i]]=de[a]+1;
24             if(e_s[i]==t) return;
25             q[head++]=e_s[i];
26         }
27     }
28 }
29 int ap(int k,int nw){
30     if(k==t) return nw;
31     int bw=nw;
32     for(int i=h[k];i&&bw;i=e_n[i])
33     if(e_w[i]&&de[e_s[i]]==de[k]+1){
34         int dw=ap(e_s[i],min_(bw,e_w[i]));
35         if(dw) e_w[i]-=dw,e_w[i^1]+=dw,bw-=dw;
36         else de[e_s[i]]=0;
37     }
38     return nw-bw;
39 }
40 void Dinic(){while(bfs(),de[t]) ans+=ap(s,0xffffff);}
41 int main(){
42     scanf("%d%d%d",&n,&f,&d);
43     s=0,t=f+n+n+d+1;
44     for(int i=1;i<=f;i++) add(s,i);
45     for(int i=1;i<=n;i++) add(f+i,f+n+i);
46     for(int i=1;i<=d;i++) add(f+n+n+i,t);
47     for(int i=1;i<=n;i++){
48         scanf("%d%d",&a,&b);
49         for(int j=1;j<=a;j++){
50             scanf("%d",&c);
51             add(c,f+i);
52         }
53         for(int j=1;j<=b;j++){
54             scanf("%d",&c);
55             add(f+n+i,f+n+n+c);
56         }
57     }
58     Dinic();
59     printf("%d",ans);
60     return 0;
61 }

1A但是是比着自己最大流的模板打的。

转载于:https://www.cnblogs.com/J-william/p/6790201.html