bzoj 1711 [Usaco2007 Open]Dining吃饭&&poj 3281 Dining

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<algorithm>
 5 #include<queue>
 6 using namespace std;
 7 const int dian=505;
 8 const int bian=50005;
 9 const int INF=0x3f3f3f3f;
10 int h[dian],ver[bian],val[bian],nxt[bian],ch[dian],cr[dian];
11 int n,m,k,tot,aa,bb,cc;
12 int S,T;
13 void add(int a,int b,int c){
14     tot++;ver[tot]=b;val[tot]=c;nxt[tot]=h[a];h[a]=tot;
15     tot++;ver[tot]=a;val[tot]=0;nxt[tot]=h[b];h[b]=tot;
16 }
17 bool tell(){
18     memset(ch,-1,sizeof(ch));
19     queue<int>q;
20     q.push(S);
21     ch[S]=0;
22     while(!q.empty()){
23         int t=q.front();
24         q.pop();
25         for(int i=h[t];i;i=nxt[i])
26             if(ch[ver[i]]==-1&&val[i]){
27                 ch[ver[i]]=ch[t]+1;
28                 q.push(ver[i]);
29             }
30     }
31     return ch[T]!=-1;
32 }
33 int zeng(int a,int b){
34     if(a==T)
35         return b;
36     int r=0;
37     for(int i=cr[a];i&&b>r;i=nxt[i])
38         if(ch[ver[i]]==ch[a]+1&&val[i]){
39             int t=zeng(ver[i],min(b-r,val[i]));
40             val[i]-=t,r+=t,val[i^1]+=t;
41             if(val[i])
42                 cr[a]=i;
43         }
44     if(!r)
45         ch[a]=-1;
46     return r;
47 }
48 int dinic(){
49     int r=0,t;
50     while(tell()){
51         for(int i=1;i<=n+n+m+k+2;i++)
52             cr[i]=h[i];
53         while(t=zeng(S,INF))
54             r+=t;
55     }
56     return r;
57 }
58 int main(){
59     memset(h,0,sizeof(h));
60     memset(nxt,0,sizeof(nxt));
61     tot=1;
62     scanf("%d%d%d",&n,&m,&k);
63     S=n+n+m+k+1,T=n+n+m+k+2;
64     for(int i=1;i<=m;i++)
65         add(S,i,1);
66     for(int i=1;i<=k;i++)
67         add(m+n+n+i,T,1);
68     for(int i=1;i<=n;i++)
69         add(m+i,m+n+i,1);
70     for(int i=1;i<=n;i++){
71         scanf("%d%d",&aa,&bb);
72         for(int j=1;j<=aa;j++){
73             scanf("%d",&cc);
74             add(cc,m+i,1);
75         }
76         for(int j=1;j<=bb;j++){
77             scanf("%d",&cc);
78             add(m+n+i,m+n+n+cc,1);
79         }
80     }
81     printf("%d",dinic());
82     return 0;
83 }