bzoj 3894: 文理分科

最小割经典模型
其实最小割就是可以保证有一条边必须被割掉

#include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=(n);i++)
#define inf 1000000000
using namespace std;
const int N=103;
const int maxn=50017;
const int M=1000005;
int ans=0;
struct E{
    int to,next,cap;E(int to=0,int next=0,int cap=0):to(to),next(next),cap(cap){}
}edge[M];
int head[maxn],cur[maxn],S=0,T=50015,n,cnt=1,tot=0,m;
void add(int x,int y,int cap){
    edge[++cnt]=E(y,head[x],cap);head[x]=cnt;
        edge[++cnt]=E(x,head[y],0);head[y]=cnt;
}
int vis[maxn],d[maxn];
bool bfs(){
    queue<int> Q;
    memset(vis,0,sizeof(vis));
    d[S]=0;vis[S]=1;
    memcpy(cur,head,sizeof(head));
    Q.push(S);
    while(!Q.empty()){
        int u=Q.front();Q.pop();
        for(int i=head[u];i;i=edge[i].next){
            int v=edge[i].to;
            if(!vis[v] && edge[i].cap){
                vis[v]=1;d[v]=d[u]+1;
                Q.push(v);
            }
        }
    }
    return vis[T];
}
int dfs(int x,int a){
    if(x==T)return a;
    int f,flow=0;
    for(int &i=cur[x];i;i=edge[i].next){
        int v=edge[i].to;
        if(edge[i].cap && d[v]==d[x]+1){
            f=dfs(v,min(a,edge[i].cap));
            a-=f;
            flow+=f;
            edge[i].cap-=f;
            edge[i^1].cap+=f;
        }
        if(!a)return flow;
    }
    return flow;
}
int dinic(){int flow=0;
    while(bfs()){
    flow+=dfs(S,inf);
}
    return flow;
}
int main(){//freopen("in.in","r",stdin);
    scanf("%d%d",&n,&m);int x;
    rep(i,1,n)rep(j,1,m){scanf("%d",&x);ans+=x;
    add(S,(i-1)*m+j,x),tot++;}

        rep(i,1,n)rep(j,1,m){scanf("%d",&x);ans+=x;
        add((i-1)*m+j,T,x),tot++;}

    rep(i,1,n)rep(j,1,m){
        scanf("%d",&x);ans+=x;
        int nx=++tot;
        rep(d1,-1,1)rep(d2,-1,1)if(d1*d2==0){
            int ni=i+d1,nj=j+d2;
            if(ni>=1 && nj>=1 && ni<=n && nj<=m){
                add(nx,(ni-1)*m+nj,inf);
            }
        }
        add(S,nx,x);
    }
    rep(i,1,n)rep(j,1,m){
        scanf("%d",&x);ans+=x;
        int nx=++tot;
        rep(d1,-1,1)rep(d2,-1,1)if(d1*d2==0){
            int ni=i+d1,nj=j+d2;
            if(ni>=1 && nj>=1 && ni<=n && nj<=m){
                add((ni-1)*m+nj,nx,inf);
            }
        }
        add(nx,T,x);
    }
    ans-=dinic();
    printf("%d",ans);
    return 0;
}