网络流模版都一样,EK就可以过,最重要的还是建图
建图思路:
将牛拆成两个顶点,一个顶点与食物连接,一个顶点与水连接,然后将这两个顶点连接,这样就可以保证一份食物匹配一份水,满足一头牛。
这样建图以后这道题就变成了一道多源点多汇点的网络流题,加上一源点,一汇点即可套模版
代码如下:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<climits>
#define MAXN 600
using namespace std;
int N, F, D;
int cap[MAXN][MAXN];
int flow[MAXN][MAXN];
int a[MAXN];
int p[MAXN];
int bfs(int s, int t)
{
int f = 0;
queue<int> q;
memset(flow, 0, sizeof(flow));
for(;;)
{
q.push(s);
memset(a, 0, sizeof(a));
a[s] = INT_MAX;
while(!q.empty())
{
int u = q.front();
q.pop();
for(int v = s; v <= t; v++)
{
if(!a[v] && flow[u][v] < cap[u][v])
{
q.push(v);
p[v] = u;
a[v] = min(cap[u][v] - flow[u][v], a[u]);
}
}
}
if(a[t] == 0)
break;
for(int u = t; u != s; u = p[u])
{
flow[p[u]][u] += a[t];
flow[u][p[u]] -= a[t];
}
f += a[t];
}
return f;
}
int main()
{
int f, d, food, drink;
while(scanf("%d%d%d", &N, &F, &D) != EOF)
{
memset(cap, 0, sizeof(cap));
for(int i = 0; i < N; i++)
{
scanf("%d%d", &f, &d);
while(f--)
{
scanf("%d", &food);
cap[food][i+1+F] = 1;
}
while(d--)
{
scanf("%d", &drink);
cap[F+N+i+1][F+2*N+drink] = 1;
}
cap[F+i+1][F+N+i+1] = 1;
}
for(int i = 1; i <= F; i++)
{
cap[0][i] = 1;
}
for(int i = F+N*2+1; i <= F+2*N+D; i++)
{
cap[i][F+2*N+D+1] = 1;
}
printf("%d\n", bfs(0, F+2*N+D+1));
}
return 0;
}