题意:有F种食物,D种饮料,N头奶牛只能吃某些食物和饮料(而且只能吃特定的一份),一种食物被一头牛吃了之后,其余牛就不能吃了。问最多可以满足多少牛。
思路:将每头牛拆成两个点,之间连一条容量为1的边,然后新建一个源点和汇点,从原点连向食物再连向牛再连向牛再连向饮料再连向汇点,边的容量都是1,然后用最大流求解就可以了。
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<ctime>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
//最大流
//Dinic算法求最大流,一般效率很高
//s源点,t汇点,g,e全局变量,表示存边的邻接表
const int INF = 1000000000;
const int MAXN = 1000, MAXM = 500000;//最大的点数和边数
struct Edge
{
int to, next, cap;
} edge[MAXM*2];
int n, s, t;
int head[MAXN], tot;
void addedge(int u, int v, int w)
{
edge[tot].to = v;
edge[tot].cap = w;
edge[tot].next = head[u];
head[u] = tot++;
edge[tot].to = u;
edge[tot].cap = 0;
edge[tot].next = head[v];
head[v] = tot++;
}
void init()
{
memset(head, -1, sizeof(head));
tot = 0;
}
queue<int> q;
bool vis[MAXN];
int dist[MAXN];
void bfs()
{
memset(dist, 0, sizeof(dist));
while(!q.empty()) q.pop();
vis[s] = 1;
q.push(s);
while(!q.empty())
{
int u = q.front();
q.pop();
for(int i = head[u]; i!=-1; i=edge[i].next)
{
if(!edge[i].cap || vis[edge[i].to]) continue;
q.push(edge[i].to);
vis[edge[i].to] = 1;
dist[edge[i].to] = dist[u] + 1;
}
}
}
int dfs(int u, int a)
{
if(u==t) return a;
int ret = 0;
for(int i = head[u]; a&&i!=-1; i = edge[i].next)
{
if(edge[i].cap && dist[u]+1==dist[edge[i].to])
{
int tmp = dfs(edge[i].to, min(a, edge[i].cap));
edge[i].cap -= tmp;
edge[i^1].cap += tmp;
a -= tmp;
ret += tmp;
}
}
return ret;
}
int maxflow()
{
int ret = 0;
while(true)
{
memset(vis, 0, sizeof(vis));
bfs();
if(!vis[t]) return ret;
ret += dfs(s, INF);
}
}
int cow, drink, food;
int main()
{
//freopen("input.txt", "r", stdin);
while(cin >> cow >> food >> drink)
{
n = food + drink + cow + cow + 2;
s = 1, t = n;
init();
for(int i = 1; i <= cow; i++)
addedge(1+food+i, 1+food+cow+i, 1);
for(int i = 1; i <= food; i++)
addedge(1, i+1, 1);
for(int i = 1; i <= drink; i++)
addedge(1+food+cow+cow+i, n, 1);
for(int i = 1; i <= cow; i++)
{
int f, d;
scanf("%d%d", &f, &d);
for(int j = 1; j <= f; j++)
{
int tmp;
scanf("%d", &tmp);
addedge(1+tmp, 1+food+i, 1);
}
for(int j = 1; j <= d; j++)
{
int tmp;
scanf("%d", &tmp);
addedge(1+food+cow+i, 1+food+cow+cow+tmp, 1);
}
}
int ans = maxflow();
cout << ans << endl;
}
return 0;
}