P1231 教辅的组成 拆点限流

如果只有两个物品的话 是一个裸的二分图匹配问题

现在变成了三个物品之间的匹配 则只要在中间加一层节点表示书 再把这层的每个点拆成两个点中间连一条边限制流量 使其只能用一次

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
#define REP(i, a, b) for(register int i = (a), i##_end_ = (b); i <= i##_end_; ++ i)
#define DREP(i, a, b) for(register int i = (a), i##_end_ = (b); i >= i##_end_; -- i)
#define mem(a, b) memset((a), b, sizeof(a))
int read()
{
    int sum = , fg = ; char c = getchar();
    while(c < '' || c > '') { if (c == '-') fg = -; c = getchar(); }
    while(c >= '' && c <= '') { sum = sum *  + c - ''; c = getchar(); }
    return sum * fg;
}
#define inf 0x3f3f3f3f
const int maxn = ;
int e,be[maxn], ne[maxn], to[maxn], c[maxn];
int nb, nex, na,m1,m2;
void add(int x, int y, int z)
{
    to[e] = y, ne[e] = be[x], be[x] = e;
    c[e] = z, e++;
    to[e] = x, ne[e] = be[y], be[y] = e;
    c[e] = , e++;
}
int d[maxn], end;
bool bfs()
{
    queue<int>q;
    memset(d,-,sizeof(d));
    q.push(end),d[end] = ;
    while(!q.empty())
    {
        int u = q.front(); q.pop();
        for(int i = be[u]; i!=-; i = ne[i])
        {
            int v = to[i];
            if(d[v] == - && c[i ^ ])
            {
                d[v] = d[u] + ;
                q.push(v);
            }
        }
    }
    return d[]!=-;
}
int dfs(int x,int low)
{
    if(x == end || !low)return low;
    int ret = ;
    for(int i = be[x]; i!=-;i = ne[i])
    {
        int v = to[i];
        if(d[v] == d[x] -  )
        {
            int    k = dfs(v,min(low-ret,c[i]));
            if(k > )
            {
                c[i] -= k;
                c[i^] += k;
                ret+=k;
            }
        }
    }
    return ret;
}
int dinic()
{
    int ans = ;
    while(bfs())
    {
        int k = dfs(,inf);
        if(k>)ans+=k;
    }
    return ans;
}
int main()
{
    memset(be,-,sizeof(be));
    nb = read(); nex = read(); na = read();
    m1 = read();
    REP(i,,m1)
    {
        int x,y;
        x = read(), y = read();
        add(y,nex+x,);
    }
    m2 = read();
    REP(i,,m2)
    {
        int x,y;
        x = read(), y = read();
        add(nex+nb+x,*nb+nex+y,);
    }
    end = *nb+nex+na+;
    REP(i,,nex)    add(,i,);
    REP(i,,na) add(*nb+nex+i,end,);
    REP(i,,nb) add(nex+i,nex+nb+i,);
    printf("%d",dinic());
    return ;
}