建图:
由于是一个牛对应一个饮料和食物,这很类似于二分图匹配,但是并不是二分图匹配。
我们想一个问题,我们将食物->牛->饮料连边建图的话,一个牛能被多个食物流过来,牛又可以将多个流通过不同的饮料流出,这样就不符合题目中的一头牛只能吃一个饮料和食物,这样我们就可以将牛进行拆点,分成牛1和牛2,这样牛1与牛2之间的流量为1,这样就很好限制了题目中的条件
- 源点:0,
- 食物;1 - 100,
- 牛1: 101 - 200
- 牛2:201 - 300
- 饮料:301 - 400
- 汇点:405
ACcode:
/*
* @Author: NEFU_马家沟老三
* @LastEditTime: 2020-11-05 21:38:08
* @CSDN blog: https://blog.csdn.net/acm_durante
* @E-mail: 1055323152@qq.com
* @ProbTitle:
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define mem(a,b) memset(a,b,sizeof(a))
const double PI = acos(-1.0);
const int N =505,M = 800000,inf = 0x3f3f3f;
/*
源点:0,
food;1 - 100,
cow1: 101 - 200
cow2:201 - 300
cd:301 - 400
汇点:405
*/
struct node{
int v,w,next;
}e[M];
int head[N],cnt,d[N],now[N];
void add(int u,int v,int w){
e[++cnt].v = v,e[cnt].w = w,e[cnt].next = head[u],head[u] = cnt;
e[++cnt].v = u,e[cnt].w = 0,e[cnt].next = head[v],head[v] = cnt;
}
queue<int>q;
bool bfs(int s,int t){//分层图
mem(d,0);
while(!q.empty()) q.pop();
q.push(s);d[s] = 1;now[s] = head[s];
while(!q.empty()){
int u = q.front();
q.pop();
for(int i = head[u] ; ~i ; i = e[i].next){
int v = e[i].v, w = e[i].w;
if(w && d[v] == 0){
q.push(v);
now[v] = head[v];
d[v] = d[u] + 1;
if(v == t) return 1;
}
}
}
return 0;
}
int dfs(int u,int t,int flow){
if(u == t) return flow;
int rest = flow, i , k;//rest 残留图的存量
for(i = now[u]; ~i && rest; i = e[i].next){
int v = e[i].v , w = e[i].w;
if(w && d[v] == d[u] + 1){
k = dfs(v,t,min(rest,w));
if(!k) d[v] = 0;//减枝
e[i].w -= k;
e[i^1].w += k;
rest -= k;
}
}
now[u] = i;
return flow - rest;
}
int dinic(int s,int t){
int res = 0,flow = 0;
while(bfs(s,t)){
while(flow = dfs(s,t,inf)) res += flow;
}
return res;
}
int main()
{
int n,f,d;
mem(head,-1);
cnt = 1;
scanf("%d%d%d",&n,&f,&d);
rep(i,1,n){
int cf,cd,x;
scanf("%d%d",&cf,&cd);
rep(j,1,cf){//food
scanf("%d",&x);
add(x,i + 100,1);
}
add(i+100,i+200,1);
rep(j,1,cd){
scanf("%d",&x);
add(i+200,x+300,1);
}
}
rep(i,1,f) add(0,i,1);
rep(i,1,d) add(i + 300,405,1);
printf("%d\n",dinic(0,405));
return 0;
}