【费用流】 FZU 2143 Board Game 棋牌模型

点击打开链接

先有一个零矩阵B 每次可以在矩阵上相连的两个格子上+1 ，并且B矩阵上的元素不得大于K

求S的最小值

经典棋牌模型

起点与偶点建K条边，容量为1

终点与奇点建边，容量为1

每一条边 

其中（1<=B<=k）

表示B每增加1得到的值

相连的格子间建cap=INF，cost=0 

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <deque>
#include <map>
#define cler(arr, val)    memset(arr, val, sizeof(arr))
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long  LL;
const int MAXN = 10200;
const int MAXM = 140000;
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
struct Edge
{
    int to,next,cap,flow,cost;
} edge[MAXM];
int head[MAXN],tol;
int pre[MAXN],dis[MAXN];
bool vis[MAXN];
int N;//节点总个数，节点编号从0~N-1
void init(int n)
{
    N = n;
    tol = 0;
    memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int cap,int cost)
{
    edge[tol].to = v;
    edge[tol].cap = cap;
    edge[tol].cost = cost;
    edge[tol].flow = 0;
    edge[tol].next = head[u];
    head[u] = tol++;
    edge[tol].to = u;
    edge[tol].cap = 0;
    edge[tol].cost = -cost;
    edge[tol].flow = 0;
    edge[tol].next = head[v];
    head[v] = tol++;
}
bool spfa(int s,int t)
{
    queue<int>q;
    for(int i = 0; i < N; i++)
    {
        dis[i] = INF;
        vis[i] = false;
        pre[i] = -1;
    }
    dis[s] = 0;
    vis[s] = true;
    q.push(s);
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        vis[u] = false;
        for(int i = head[u]; i != -1; i = edge[i].next)
        {
            int v = edge[i].to;

            if(edge[i].cap > edge[i].flow && dis[v] > dis[u] + edge[i].cost )
            {
                dis[v] = dis[u] + edge[i].cost;
                pre[v] = i;
                if(!vis[v])
                {
                    vis[v] = true;
                    q.push(v);
                }
            }
        }
    }
    if(dis[t]>0) return false;
    if(pre[t] == -1)return false;
    else return true;
} //返回的是最大流，cost存的是最小费用
int minCostMaxflow(int s,int t,int &cost)
{
    int flow = 0;
    cost = 0;
    while(spfa(s,t))
    {
        int Min = INF;
        for(int i = pre[t]; i != -1; i = pre[edge[i^1].to])
        {
            if(Min > edge[i].cap - edge[i].flow)
                Min = edge[i].cap - edge[i].flow;
        }
        for(int i = pre[t]; i != -1; i = pre[edge[i^1].to])
        {
            edge[i].flow += Min;
            edge[i^1].flow -= Min;
            cost += edge[i].cost * Min;
        }
        flow += Min;
    }
    return flow;
}
int xx[4]= {0,0,-1,1};
int yy[4]= {-1,1,0,0};
int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    //  freopen("out.txt", "w", stdout);
#endif
    int t,cas=1,n,m,k;
    cin>>t;
    while(t--)
    {
        cin>>n>>m>>k;
        init(n*m+2);
        int star=n*m,end=n*m+1,ans=0,a;
        for(int i=0; i<n; i++)
            for(int j=0; j<m; j++)
            {
                cin>>a;
                ans+=a*a;
                if((i+j)%2==0)
                {
                    for(int w=1; w<=k; w++)
                        addedge(star,i*m+j,1,2*w-1-2*a);
                    for(int w=0; w<4; w++)
                    {
                        int dx=i+xx[w];
                        int dy=j+yy[w];
                        if(dx>=0&&dx<n&&dy>=0&&dy<m)
                            addedge(i*m+j,dx*m+dy,INF,0);
                    }
                }
                else
                {
                    for(int w=1; w<=k; w++)
                        addedge(i*m+j,end,1,2*w-1-2*a);
                }
            }
        int cost;
        minCostMaxflow(star,end,cost);
        printf("Case %d: %d\n",cas++,cost+ans);
    }
    return 0;
}