bzoj 3894（最小割）

传送门
经典的建图模型，本蒟蒻赶紧orz。
1.source连p（容量为art），p连sink（容量为science）
2.source连p1（容量为same_art），p1连p及其相邻点（容量为INF）
3.p2连sink（容量为same_science），p及其相邻点连p2（容量为INF）
最后跑一边最小割得到min_cut，
ans=sum(art)+sum(same_art)+sum(science)+sum(same_science)-min_cut;

下面是代码，如果将所有结点编号都记录一下而不是每次计算的话，应该可以再跑快一点，1840ms还是慢得比较明显了QAQ。。。

#include<bits/stdc++.h>
#define p(i,j) (i-1)*m+j
#define p1(i,j) siz+(i-1)*m+j
#define p2(i,j) (siz<<1)+(i-1)*m+j
#define in(i,j) i>0&&i<=n&&j>0&&j<=m
using namespace std;
const int maxn=102,INF=0x3f3f3f3f,sz=maxn*maxn*3;
int n,m,siz,tim=0,sink,source,sum=0;
int c[maxn][maxn];//the number of p(i,j)
inline int read() {
    int x=0,f=1;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
    return x*f;
}
int head[sz],cur[sz],dis[sz],edge=0;
struct EDGE {
    int v,nxt,r;
}e[sz*10];
inline void adde(int u,int v,int r) {
    e[edge].nxt=head[u],e[edge].v=v,e[edge].r=r,head[u]=edge++;
    e[edge].nxt=head[v],e[edge].v=u,e[edge].r=0,head[v]=edge++;
}
inline bool bfs() {
    queue<int> q;
    memset(dis,-1,sizeof(dis)),dis[source]=0;
    q.push(source);
    while (!q.empty()) {
        int p=q.front();q.pop();
        for (int i=head[p];~i;i=e[i].nxt) {
            int v=e[i].v;
            if (e[i].r>0&&dis[v]==-1)
                dis[v]=dis[p]+1,q.push(v);
        }
    }
    return ~dis[sink];
}
int dfs(int p,int low) {
    if (p==sink||low==0) return low;
    int cost=0,flow;
    for (int &i=cur[p];~i;i=e[i].nxt) {
        int v=e[i].v;
        if (e[i].r>0&&dis[v]==dis[p]+1&&(flow=dfs(v,min(low,e[i].r)))) {
            e[i].r-=flow,
            e[i^1].r+=flow,
            cost+=flow,
            low-=flow;
            if (low==0) return cost;
        }
    }
    if (low>0) dis[p]=-1;
    return cost;
}

int main() {
//  freopen("bzoj 3894.in","r",stdin);
    memset(head,-1,sizeof(head));
    n=read(),m=read(),siz=n*m,source=0,sink=siz*3+1;
    for (int i=1;i<=n;++i)
        for (int j=1;j<=m;++j) {
            int val=read();
            sum+=val;
            adde(source,p(i,j),val);
        }
    for (int i=1;i<=n;++i)
        for (int j=1;j<=m;++j) {
            int val=read();
            sum+=val;
            adde(p(i,j),sink,val);
        }
    for (int i=1;i<=n;++i)
        for (int j=1;j<=m;++j) {
            int val=read();
            sum+=val;
            adde(source,p1(i,j),val);
            if (in(i,j)) adde(p1(i,j),p(i,j),INF);
            if (in(i-1,j)) adde(p1(i,j),p(i-1,j),INF);
            if (in(i+1,j)) adde(p1(i,j),p(i+1,j),INF);
            if (in(i,j-1)) adde(p1(i,j),p(i,j-1),INF);
            if (in(i,j+1)) adde(p1(i,j),p(i,j+1),INF);
        }
    for (int i=1;i<=n;++i)
        for (int j=1;j<=m;++j) {
            int val=read();
            sum+=val;
            adde(p2(i,j),sink,val);
            if (in(i,j)) adde(p(i,j),p2(i,j),INF);
            if (in(i-1,j)) adde(p(i-1,j),p2(i,j),INF);
            if (in(i+1,j)) adde(p(i+1,j),p2(i,j),INF);
            if (in(i,j-1)) adde(p(i,j-1),p2(i,j),INF);
            if (in(i,j+1)) adde(p(i,j+1),p2(i,j),INF);
        }
    int min_cut=0;
    while (bfs()) {
        int a;
        for (int i=source;i<=sink;++i) cur[i]=head[i];
        while (a=dfs(source,INF)) min_cut+=a;
    }
    printf("%d\n",sum-min_cut);
    return 0;
}