UVa1212 Duopoly（最小割）

  1 #include<cstdio>
  2 #include<cstring>
  3 #include<queue>
  4 #include<algorithm>
  5 using namespace std;
  6 #define INF (1<<30)
  7 #define MAXN 6666
  8 #define MAXM 3333*6666
  9 
 10 struct Edge{
 11     int v,cap,next;
 12 }edge[MAXM];
 13 int vs,vt,NE,NV;
 14 int head[MAXN];
 15 
 16 void addEdge(int u,int v,int cap){
 17     edge[NE].v=v; edge[NE].cap=cap;
 18     edge[NE].next=head[u]; head[u]=NE++;
 19     edge[NE].v=u; edge[NE].cap=0;
 20     edge[NE].next=head[v]; head[v]=NE++;
 21 }
 22 
 23 int level[MAXN];
 24 int gap[MAXN];
 25 void bfs(){
 26     memset(level,-1,sizeof(level));
 27     memset(gap,0,sizeof(gap));
 28     level[vt]=0;
 29     gap[level[vt]]++;
 30     queue<int> que;
 31     que.push(vt);
 32     while(!que.empty()){
 33         int u=que.front(); que.pop();
 34         for(int i=head[u]; i!=-1; i=edge[i].next){
 35             int v=edge[i].v;
 36             if(level[v]!=-1) continue;
 37             level[v]=level[u]+1;
 38             gap[level[v]]++;
 39             que.push(v);
 40         }
 41     }
 42 }
 43 
 44 int pre[MAXN];
 45 int cur[MAXN];
 46 int ISAP(){
 47     bfs();
 48     memset(pre,-1,sizeof(pre));
 49     memcpy(cur,head,sizeof(head));
 50     int u=pre[vs]=vs,flow=0,aug=INF;
 51     gap[0]=NV;
 52     while(level[vs]<NV){
 53         bool flag=false;
 54         for(int &i=cur[u]; i!=-1; i=edge[i].next){
 55             int v=edge[i].v;
 56             if(edge[i].cap && level[u]==level[v]+1){
 57                 flag=true;
 58                 pre[v]=u;
 59                 u=v;
 60                 //aug=(aug==-1?edge[i].cap:min(aug,edge[i].cap));
 61                 aug=min(aug,edge[i].cap);
 62                 if(v==vt){
 63                     flow+=aug;
 64                     for(u=pre[v]; v!=vs; v=u,u=pre[u]){
 65                         edge[cur[u]].cap-=aug;
 66                         edge[cur[u]^1].cap+=aug;
 67                     }
 68                     //aug=-1;
 69                     aug=INF;
 70                 }
 71                 break;
 72             }
 73         }
 74         if(flag) continue;
 75         int minlevel=NV;
 76         for(int i=head[u]; i!=-1; i=edge[i].next){
 77             int v=edge[i].v;
 78             if(edge[i].cap && level[v]<minlevel){
 79                 minlevel=level[v];
 80                 cur[u]=i;
 81             }
 82         }
 83         if(--gap[level[u]]==0) break;
 84         level[u]=minlevel+1;
 85         gap[level[u]]++;
 86         u=pre[u];
 87     }
 88     return flow;
 89 }
 90 
 91 char str[33333];
 92 
 93 int A[3333][33],B[3333][33];
 94 int valA[3333],valB[3333];
 95 
 96 bool vis[333333];
 97 
 98 int main(){
 99     int t,n,m;
100     scanf("%d",&t);
101     for(int cse=1; cse<=t; ++cse){
102 
103         int n;
104         scanf("%d",&n);
105         for(int i=1; i<=n; ++i){
106             A[i][0]=0;
107         }
108         for(int i=1; i<=n; ++i){
109             scanf("%d ",&valA[i]);
110             gets(str);
111             char *s=str; int a;
112             while(*s==‘ ‘) ++s;
113             while(sscanf(s,"%d",&a)==1){
114                 A[i][++A[i][0]]=a;
115                 while(*s>=‘0‘ && *s<=‘9‘) ++s;
116                 while(*s==‘ ‘) ++s;
117             }
118         }
119 
120         int m;
121         scanf("%d",&m);
122         for(int i=1; i<=m; ++i){
123             B[i][0]=0;
124         }
125         for(int i=1; i<=m; ++i){
126             scanf("%d ",&valB[i]);
127             gets(str);
128             char *s=str; int a;
129             while(*s==‘ ‘) ++s;
130             while(sscanf(s,"%d",&a)==1){
131                 B[i][++B[i][0]]=a;
132                 while(*s>=‘0‘ && *s<=‘9‘) ++s;
133                 while(*s==‘ ‘) ++s;
134             }
135         }
136 
137         vs=0; vt=n+m+1; NV=vt+1; NE=0;
138         memset(head,-1,sizeof(head));
139 
140         int tot=0;
141         for(int i=1; i<=n; ++i){
142             tot+=valA[i];
143             addEdge(vs,i,valA[i]);
144         }
145         for(int i=1; i<=m; ++i){
146             tot+=valB[i];
147             addEdge(i+n,vt,valB[i]);
148         }
149 
150         for(int i=1; i<=n; ++i){
151             for(int j=1; j<=m; ++j){
152                 for(int k=1; k<=A[i][0]; ++k) vis[A[i][k]]=1;
153                 bool flag=1;
154                 for(int k=1; k<=B[j][0]; ++k){
155                     if(vis[B[j][k]]){
156                         flag=0;
157                         break;
158                     }
159                 }
160                 if(!flag) addEdge(i,j+n,INF);
161                 for(int k=1; k<=A[i][0]; ++k) vis[A[i][k]]=0;
162             }
163         }
164 
165         if(cse!=1) putchar(‘\n‘);
166         printf("Case %d:\n",cse);
167         printf("%d\n",tot-ISAP());
168     }
169     return 0;
170 }