题目大意:有F种食物,D种饮料,N头奶牛,只能吃某种食物和饮料(而且只能吃特定的一份)一种食物被一头牛吃了之后,其余牛就不能吃了
要求输出最多分配能够满足的牛的数量
题解:解题思路:建图,有2*n+f+d+2个顶点,0表示源点,2*n+f+d+1表示汇点,由源点指向食物,再由食物指向牛,牛再指向对应的饮料,饮料再指向汇点
当然要使每一头牛都对应每一份食物与饮料,所以应该牛i指向牛i再指向饮料,这样就可以避免一头牛只占用多份食物与饮料了。全部是有向的边,而且权值全部为1,我在这里是1到f为食物点,f+1到f+2*n为牛点,f+2*n+1到f+2*n+d为饮料点。
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-9
#define maxn 100100
#define MOD 1000000007
const int MAXN = 100010;
const int MAXM = 400010;
struct Edge
{
int to,next,cap,flow;
}edge[MAXM];
int tot,n,m;
int head[MAXN];
int gap[MAXN],dep[MAXN];
int pre[MAXN],cur[MAXN];
void init()
{
tot = 0;
memset(head,-1,sizeof(head));
}
void add_edge(int u,int v,int w,int rw = 0)
{
edge[tot].to = v;
edge[tot].cap = w;
edge[tot].flow = 0;
edge[tot].next = head[u];
head[u] = tot++;
edge[tot].to = u;
edge[tot].cap = rw;
edge[tot].flow = 0;
edge[tot].next = head[v];
head[v] = tot++;
}
int sap(int start,int en)
{
memset(gap,0,sizeof(gap));
memset(dep,0,sizeof(dep));
memcpy(cur,head,sizeof(head));
int u = start;
pre[u] = -1;
gap[0] = n;
int ans = 0;
while(dep[start] < n)
{
if(u == en)
{
int Min = INF;
for(int i = pre[u]; i != -1; i = pre[edge[i^1].to])
if(Min > edge[i].cap - edge[i].flow)
Min = edge[i].cap - edge[i].flow;
for(int i = pre[u]; i != -1; i = pre[edge[i^1].to])
{
edge[i].flow += Min;
edge[i^1].flow -= Min;
}
u = start;
ans += Min;
continue;
}
int flag = 0;
int v;
for(int i = cur[u]; i != -1; i = edge[i].next)
{
v = edge[i].to;
if(edge[i].cap - edge[i].flow && dep[v]+1 == dep[u])
{
flag = 1;
cur[u] = pre[v] = i;
break;
}
}
if(flag)
{
u = v;
continue;
}
int Min = n;
for(int i = head[u]; i != -1; i = edge[i].next)
if(edge[i].cap - edge[i].flow && dep[edge[i].to] < Min)
{
Min = dep[edge[i].to];
cur[u] = i;
}
gap[dep[u]]--;
if(!gap[dep[u]])
return ans;
dep[u] = Min + 1;
gap[dep[u]]++;
if(u != start)
u = edge[pre[u]^1].to;
}
return ans;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t,C = 1;
//scanf("%d",&t);
int F,D;
while(scanf("%d%d%d",&n,&F,&D) != EOF)
{
init();
for(int i = 1; i <= F; i++)
add_edge(0,i,1);
for(int i = F+2*n+1; i <= F+D+2*n; i++)
add_edge(i,F+D+2*n+1,1);
for(int i = 1; i <= n; i++)
{
int f,d,x;
scanf("%d%d",&f,&d);
while(f--)
{
scanf("%d",&x);
add_edge(x,F+i,1);
}
while(d--)
{
scanf("%d",&x);
add_edge(F+n+i,F+2*n+x,1);
}
add_edge(F+i,F+n+i,1);
}
n = F+D+2*n+2;
printf("%d\n",sap(0,n-1));
}
return 0;
}