题意
每头牛可搭配一种食物和一种饮料 每种食物只有一份 问最多可以满足多少头牛既有饮料又有实物
思路
拆点
对于每头牛拆为一个入点一个出点 边权为1 从而可以满足同一头牛只使用一次
代码
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
const int N = 1010, M = 100010, INF = 1e8;
int n, F, D, S, T;
int h[N], e[M], ne[M], f[M], idx;
int cur[N], q[N], d[N];
void add(int a, int b, int c)
{
e[idx] = b, ne[idx] = h[a], f[idx] = c, h[a] = idx ++ ;
e[idx] = a, ne[idx] = h[b], f[idx] = 0, h[b] = idx ++ ;
}
bool bfs()
{
memset(d, -1, sizeof d);
int hh = 0, tt = 0;
d[S] = 0, q[0] = S, cur[S] = h[S];
while (hh <= tt)
{
int t = q[hh ++ ];
for (int i = h[t]; ~i; i = ne[i])
{
int ver = e[i];
if (d[ver] == -1 && f[i])
{
d[ver] = d[t] + 1;
cur[ver] = h[ver];
if (ver == T) return true;
q[ ++ tt] = ver;
}
}
}
return false;
}
int find(int u, int limit)
{
if (u == T) return limit;
int flow = 0;
for (int i = cur[u]; ~i && flow < limit; i = ne[i])
{
int ver = e[i];
cur[u] = i;
if (d[ver] == d[u] + 1 && f[i])
{
int t = find(ver, min(f[i], limit - flow));
if (!t) d[ver] = -1;
f[i] -= t, f[i ^ 1] += t, flow += t;
}
}
return flow;
}
int dinic()
{
int r = 0, flow;
while (bfs()) while (flow = find(S, INF)) r += flow;
return r;
}
int main()
{
scanf("%d%d%d", &n, &F, &D);
S = 0, T = N - 1;
memset(h, -1, sizeof h);
for (int i = 1; i <= F; i ++ ) add(S, i + n * 2, 1);
for (int i = 1; i <= D; i ++ ) add(i + n * 2 + F, T, 1);
for (int i = 1; i <= n; i ++ ) add(i, i + n, 1);
for (int i = 1; i <= n; i ++ )
{
int a, b, t;
scanf("%d%d", &a, &b);
while (a -- )
{
scanf("%d", &t);
add(t + n * 2, i, 1);
}
while (b -- )
{
scanf("%d", &t);
add(i + n, t + n * 2 + F, 1);
}
}
printf("%d\n", dinic());
return 0;
}