题目链接:点击进入
思路
源点->练习册->书(拆点)->答案->汇点
(连边容量都为 1 ,同时书要拆点,如果不拆点,书会被用很多次,但是因为一本书只能用一次,所以可以通过拆点来避免这个问题。)
剩下的就是跑 dinic 了
想看图请点击进入
代码
#include<cstdio>
#include<algorithm>
#include<queue>
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
const int maxn=1e6+10;
struct node
{
int to;
int next;
ll val;
}edge[maxn];
int head[maxn],tot;
void add(int u,int v,int val)
{
edge[tot].to=v;
edge[tot].val=val;
edge[tot].next=head[u];
head[u]=tot++;
}
int deep[maxn];
int cur[maxn];
int n1,n2,n3,m1,m2,x,y;
ll res;
int s;
int t;
int dfs(int pos,int flow)
{
if(pos==t) return flow;
int rest=flow,k,i;
for(i=cur[pos];i!=-1&&rest;i=edge[i].next)
{
int v=edge[i].to;
int val=edge[i].val;
if(deep[v]==deep[pos]+1&&val)
{
k=dfs(v,min(val,rest));
if(!k) deep[v]=0;
edge[i].val-=k;
edge[i^1].val+=k;
rest-=k;
}
}
cur[pos]=i;
return flow-rest;
}
bool bfs()
{
memset(deep,0,sizeof(deep));
deep[s]=1;
queue<int>q;
q.push(s);
cur[s]=head[s];
while(q.size())
{
int now=q.front();
q.pop();
for(int i=head[now];i!=-1;i=edge[i].next)
{
int v=edge[i].to;
if(edge[i].val&&!deep[v])
{
q.push(v);
cur[v]=head[v];
deep[v]=deep[now]+1;
if(v==t) return 1;
}
}
}
return 0;
}
void dinic()
{
while(bfs())
res+=dfs(s,0x3f3f3f3f);
}
int main()
{
ios::sync_with_stdio(false);
memset(head,-1,sizeof(head));
cin>>n1>>n2>>n3;
s=2*n1+n2+n3+1,t=2*n1+n2+n3+2;
for(int i=1;i<=n2;i++)
{
add(s,i,1);
add(i,s,0);
}
for(int i=n2+2*n1+1;i<=n2+2*n1+n3;i++)
{
add(i,t,1);
add(t,i,0);
}
cin>>m1;
for(int i=1;i<=m1;i++)
{
cin>>x>>y;
add(y,x+n2,1);
add(x+n2,y,0);
}
cin>>m2;
for(int i=1;i<=m2;i++)
{
cin>>x>>y;
add(x+n2+n1,y+n2+2*n1,1);
add(y+n2+2*n1,x+n2+n1,0);
}
for(int i=1;i<=n1;i++)
{
add(i+n2,i+n2+n1,1);
add(i+n2+n1,i+n2,0);
}
dinic();
printf("%lld\n",res);
return 0;
}