题目链接:
https://www.luogu.com.cn/problem/P1231
思路和https://blog.csdn.net/aiwo1376301646/article/details/104251335完全一致,请移步看思路
区别在于这道题目FF算法仅仅AC了3个测试点,有7个测试点TLE
附上30分代码
#include <bits/stdc++.h>
using namespace std;
const int maxn=4e4+2,maxm=1e5+4e4+1;
int n1,n2,n3,m1,m2,a,b,s,t,tot=1,head[maxn],vis[maxn];
struct edge
{
int to,next,w;
}e[maxm];
void addedge(int x,int y,int w)
{
e[++tot].to=y;
e[tot].w=w;
e[tot].next=head[x];
head[x]=tot;
}
int dfs(int x,int flow)
{
if(x==t)return flow;
vis[x]=1;
for(int i=head[x];i;i=e[i].next)
{
int y=e[i].to,w=e[i].w;
if(w&&!vis[y])
{
int t=dfs(y,min(flow,w));
if(t>0)
{
e[i].w-=t;
e[i^1].w+=t;
return t;
}
}
}
return 0;
}
int main()
{
ios::sync_with_stdio(0);
scanf("%d%d%d",&n1,&n2,&n3);
s=0,t=n2+n1+n1+n3+1;
for(int i=1;i<=n1;i++)addedge(i,i+n1,1),addedge(i+n1,i,0);
for(int i=2*n1+1;i<=2*n1+n2;i++)addedge(0,i,1),addedge(i,0,0);
for(int i=2*n1+n2+1;i<=2*n1+n2+n3;i++)addedge(i,t,1),addedge(t,i,0);
scanf("%d",&m1);
for(int i=1;i<=m1;i++)
{
scanf("%d %d",&a,&b);
addedge(2*n1+b,a,1),addedge(a,2*n1+b,0);
}
scanf("%d",&m2);
for(int i=1;i<=m2;i++)
{
scanf("%d %d",&a,&b);
addedge(n1+a,2*n1+n2+b,1),addedge(2*n1+n2+b,n1+a,0);
}
int res=0,ans=0;
while(memset(vis,0,sizeof(vis))&&(res=dfs(s,1e9))>0)ans+=res;
printf("%d\n",ans);
return 0;
}
AC代码,Dinic算法(FF算法的优化算法)
#include <bits/stdc++.h>
using namespace std;
const int maxn=4e4+ 2,maxm=1e5 + 4e4+1;
int n1,n2,n3,m1,m2,s,t,a,b,tot=1,head[maxn],dep[maxn],ans;//用上了分层图,可以用dep判重了
struct edge
{
int to,next,w;
}e[maxm];
inline int read() {
int x=0,w=0; char ch = 0;
while(!isdigit(ch)) {w |= ch == '-';ch = getchar();}
while(isdigit(ch)) x= (x<<3) + (x<<1) + (ch^48),ch = getchar();
return w ? -x : x;
}
void addedge(int x,int y,int w)
{
e[++tot].to=y;
e[tot].w=w;
e[tot].next=head[x];
head[x]=tot;
}
bool bfs()//bool 函数是一个小优化,判断是否能搜到汇点,如果连汇点都搜不到还dfs干什么?
{
memset(dep,0,sizeof dep);//一定要初始化
queue<int>q;
q.push(s);dep[s]=1;
while(!q.empty())
{
int x=q.front();q.pop();
for(int i=head[x];i;i=e[i].next)
{
int y=e[i].to,w=e[i].w;
if(w&&!dep[y])//如果有残余流量(没有的话谁也过不去)并且这个点是第一次到达
{
dep[y]=dep[x]+1;
q.push(y);
}
}
}
return dep[t];//t 的深度不为0,就是搜到了汇点
}
int dfs(int x,int flow)
{
if(x==t)return flow;
int sum=0;
for(int i=head[x];i;i=e[i].next)
{
int y=e[i].to,w=e[i].w;
if(w&&dep[y]==dep[x]+1)//仅允许流向下一层
{
int t=dfs(y,min(w,flow));
e[i].w-=t;e[i^1].w+=t;
flow-=t;sum+=t;
}
}
if(!sum)dep[x]=0;//我与终点(顺着残余网络)不连通的话,那么上一层的点请别给我流量
return sum;
}
int main()
{
ios::sync_with_stdio(0);
n1= read(),n2= read(),n3= read();
s=0,t=n2+n1+n1+n3+1;
for(int i=1;i<=n1;i++)addedge(i,i+n1,1),addedge(i+n1,i,0);
for(int i=2*n1+1;i<=2*n1+n2;i++)addedge(0,i,1),addedge(i,0,0);
for(int i=2*n1+n2+1;i<=2*n1+n2+n3;i++)addedge(i,t,1),addedge(t,i,0);
m1=read();
for(int i=1;i<=m1;i++)
{
a=read(),b=read();
addedge(2*n1+b,a,1),addedge(a,2*n1+b,0);
}
m2=read();
for(int i=1;i<=m2;i++)
{
a=read(),b=read();
addedge(n1+a,2*n1+n2+b,1),addedge(2*n1+n2+b,n1+a,0);
}
int ans=0;
while(bfs())ans+=dfs(s,2e9);
printf("%d\n",ans);
return 0;
}