dinic+当前弧优化
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<deque>
#include<algorithm>
#include<vector>
#define LL long long
#define INF 0X7FFFFFFF
using namespace std;
int val[500];
int dist[1000];
int cur[500];
int N,M,S,T,R=-1;
LL ans=0;
struct Node
{
int u,v,cap;
}F[100005];
vector<int> map[505];
inline void addedge(int u,int v,int cap)
{
R++;map[u].push_back(R);
F[R].u=u;F[R].v=v;F[R].cap=cap;
R++;map[v].push_back(R);
F[R].u=v;F[R].v=u;F[R].cap=0;
}
inline bool bfs()
{
int i,temp;deque<int> Q;
Q.push_back(0);memset(dist,-1,sizeof(dist));
dist[0]=0;Node next;
while(!Q.empty())
{
temp=Q.at(0);Q.pop_front();
for(int i=0;i<map[temp].size();i++)
{
next=F[map[temp][i]];
if(dist[next.v]==-1&&next.cap>0)
{
dist[next.v]=dist[temp]+1;
Q.push_back(next.v);
}
}
}
if(dist[T]==-1)
return 0;
return 1;
}
inline int dinic(int x,int low)
{
int temp;Node next;
if(x==T)
return low;
for(int i=cur[x];i<map[x].size();i++)
{
cur[x]=i;
next=F[map[x][i]];
if(next.cap>0&&dist[next.v]==dist[x]+1&&(temp=dinic(next.v,min(low,next.cap))))
{
F[map[x][i]].cap-=temp;
F[map[x][i]^1].cap+=temp;
return temp;
}
}
return 0;
}
int main()
{
freopen("destroyingthegraph.in","r",stdin);
freopen("destroyingthegraph.out","w",stdout);
int i,a,b;Node next;
scanf("%d%d",&N,&M);
S=0;T=2*N+1;
for(i=1;i<=N;i++)
scanf("%d",&val[i+N]);
for(i=1;i<=N;i++)
scanf("%d",&val[i]);
for(i=1;i<=M;i++)
{
scanf("%d%d",&a,&b);
addedge(a,b+N,INF);
}
for(i=1;i<=N;i++)
{
addedge(S,i,val[i]);
addedge(i+N,T,val[i+N]);
}
int P;
while(bfs())
{
memset(cur,0,sizeof(cur));
while(P=dinic(S,INF))
{
// memset(cur,0,sizeof(cur));
ans+=P;
// cout<<ans<<endl;
}
}
printf("%lld\n",ans);
return 0;
}