[BZOJ1324]Exca王者之剑（最小割）

题目描述

传送门

题解

题目就是吓唬你玩的
实际上就是有边相邻的格子不能同时选
黑白染色之后最小割

代码

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
#define N 2000005
#define inf 1000000000

int n,m,s,t,maxflow,ans;
int tot,point[N],nxt[N],v[N],remain[N];
int color[N],deep[N],cur[N];
queue <int> q;

void addedge(int x,int y,int cap)
{
    if (color[y]<color[x]) swap(x,y);
//  printf("%d %d %d\n",x,y,cap);
    ++tot; nxt[tot]=point[x]; point[x]=tot; v[tot]=y; remain[tot]=cap;
    ++tot; nxt[tot]=point[y]; point[y]=tot; v[tot]=x; remain[tot]=0;
}
bool bfs(int s,int )
{
    for (int i=1;i<=t;++i) deep[i]=t;
    deep[s]=0;
    for (int i=1;i<=t;++i) cur[i]=point[i];
    q.push(s);
    while (!q.empty())
    {
        int now=q.front();q.pop();
        for (int i=point[now];i!=-1;i=nxt[i])
            if (deep[v[i]]==t&&remain[i])
            {
                deep[v[i]]=deep[now]+1;
                q.push(v[i]);
            }
    }
    return deep[t]<t;
}
int dfs(int now,int t,int limit)
{
    if (now==t||!limit) return limit;
    int flow=0,f;
    for (int i=cur[now];i!=-1;i=nxt[i])
    {
        cur[now]=i;
        if (deep[v[i]]==deep[now]+1&&(f=dfs(v[i],t,min(limit,remain[i]))))
        {
            flow+=f;
            limit-=f;
            remain[i]-=f;
            remain[i^1]+=f;
            if (!limit) break;
        }
    }
    return flow;
}
void dinic()
{
    while (bfs(s,t))
        maxflow+=dfs(s,t,inf);
}
int main()
{
    scanf("%d%d",&n,&m);
    s=n*m+1,t=s+1;
    tot=-1;memset(point,-1,sizeof(point));
    for (int i=1;i<=n;++i)
        for (int j=1;j<=m;++j)
        {
            int x;scanf("%d",&x);ans+=x;
            int now=(i-1)*m+j;
            if (i&1)
            {
                if (j&1) addedge(s,now,x);
                else addedge(now,t,x),color[now]=1;
            }
            else
            {
                if (j&1) addedge(now,t,x),color[now]=1;
                else addedge(s,now,x);
            }
        }
    for (int i=1;i<=n;++i)
        for (int j=1;j<=m;++j)
        {
            int now=(i-1)*m+j;
            if (j!=m) addedge(now,now+1,inf);
            if (i!=n) addedge(now,now+m,inf);
        }
    dinic();
    printf("%d\n",ans-maxflow);
}