bzoj3996 dinic

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define INF 100000000
struct sef { int ne,en,w; }h[3500050];
int tot,first[500005],cur[500050];
int q[3500050],tail;
int dis[500050];
int n,T,ans,nn;
inline void setl(int x,int y,int v)
{
h[++tot]=(sef){first[x],y,v};
first[x]=tot;

h[++tot]=(sef){first[y],x,0};
first[y]=tot;
}
inline bool Bfs()
{
q[tail=1]=0;
for (int i=1;i<=T;++i) dis[i]=-1;
dis[0]=0;
int x,y;
for (int j=1;j<=tail;++j) {
x=q[j]; cur[x]=first[x];
for (int i=first[x];y=h[i].en,i;i=h[i].ne)
if (h[i].w&&dis[y]==-1)
dis[y]=dis[x]+1,q[++tail]=y;
}
return (dis[T]>-1);
}
int Dfs(int x,int flow)
{
if (x==T) return flow;
int y,tmp=0,ret;
for (int &i=cur[x];y=h[i].en,i;i=h[i].ne)
if (dis[y]==dis[x]+1) {
ret=Dfs(y,min(flow,h[i].w));
h[i].w-=ret;    h[i^1].w+=ret;
flow-=ret;  tmp+=ret;
if (!flow) return tmp;
}
return tmp;
}
int main()
{
scanf("%d",&n); nn=n*n; tot=1;
int x,p;
for (int i=1;i<=n;++i) {
p=(i-1)*n;
for (int j=1;j<=n;++j) {
scanf("%d",&x);
ans+=x;
setl(0,p+j,x);
setl(p+j,nn+i,INF);
setl(p+j,nn+j,INF);
}
}
T=nn+n+1;
for (int i=1;i<=n;++i) {
scanf("%d",&x);
setl(nn+i,T,x);
}
while (Bfs()) ans-=Dfs(0,INF);
printf("%d\n",ans);
}