bzoj1324: Exca王者之剑

传送门
将图染色后大力跑最小点权点覆盖（四个方向）
答案=总权值-最小点权点覆盖。

#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 10010
#define inf 1e9
using namespace std;
int n,m,T,ans,tot=1,x,y;
int a[105][105],id[105][105];
int head[N],dis[N],q[N];
int c[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
struct edge{int to,next,f;}e[100005];
void add(int x,int y,int f){
    e[++tot]=(edge){y,head[x],f};
    head[x]=tot;
    e[++tot]=(edge){x,head[y],0};
    head[y]=tot;
}
bool bfs(){
    for (int i=1;i<=T;i++) dis[i]=-1;
    int h=0,t=1,x; q[1]=dis[0]=0;
    while (h!=t){
        x=q[++h];
        for (int i=head[x];i;i=e[i].next)
            if (dis[e[i].to]==-1&&e[i].f)
                dis[e[i].to]=dis[x]+1,q[++t]=e[i].to;
    }
    for (h=0;h<=500000000;h++);
    return dis[T]!=-1;
}
int dfs(int x,int flow){
    if (x==T) return flow;
    int k,rest=flow;
    for (int i=head[x];i&&rest;i=e[i].next)
        if (dis[e[i].to]==dis[x]+1&&e[i].f){
            k=dfs(e[i].to,min(rest,e[i].f));
            rest-=k; e[i].f-=k; e[i^1].f+=k;
        }
    if (rest) dis[x]=-1;
    return flow-rest;
}
int main(){
    scanf("%d%d",&n,&m); T=n*m+1;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++){
            scanf("%d",&a[i][j]);
            ans+=a[i][j];
        }
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++)
            id[i][j]=(i-1)*m+j;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++)
            if ((i+j)&1){
                add(0,id[i][j],a[i][j]);
                for (int k=0;k<4;k++){
                    x=i+c[k][0],y=j+c[k][1];
                    if (x<1|y<1|x>n|y>m) continue;
                    add(id[i][j],id[x][y],inf);
                }
            }
            else add(id[i][j],T,a[i][j]);
    while (bfs()) ans-=dfs(0,inf);
    printf("%d",ans);
}