ACM/ICPC2015沈阳区域赛 HDU5520 NumberLink （费用流）

题意：  NxM的格子有些上面有数字（空格用0表示）

             如果头是奇数尾是偶数，则不用形成回路，连起来就好。

             其他的格子连成一个个回路，相邻两个格子相连也算是一个回路  按两条边算。

             连线不能相交，给出相邻两个格子相连的费用，求最少的费用。

分析：

每个格子拆成两个点。

1.一个格子如果为空，源点连入点，出点连汇点。流量为1费用为0

2.为奇数，源点连入点。流量为1费用为0

3.为偶数，出点连汇点。流量为1费用为0
4. 每个点的入点连相邻四格的出点，流量为1费用为cost。

求最小费用最大流，如果不是满流，则为-1。

不懂的话照着样例连连线就懂了。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<vector>
#include<cctype>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<iomanip>
#include<sstream>
#include<limits>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;

const int MAXN = 10000;
const int MAXM = 100000;
const int INF = 0x3f3f3f3f;
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(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 n,m;
int cal(int i,int j)
{
    return (i-1)*m+j;
}
int main(){
#ifdef LOCAL
	freopen("C:\\Users\\lanjiaming\\Desktop\\acm\\in.txt","r",stdin);
	//freopen("output.txt","w",stdout);
#endif
//ios_base::sync_with_stdio(0);
    int T,kase = 0;
    scanf("%d",&T);
    while(T--)
    {
        int num = 0;
        scanf("%d%d",&n,&m);
        int s = 0,t = n*m*2+1;
        init(t+1);
        for(int i = 1;  i <= n; i++)
           for(int j = 1; j <= m;j++)
           {
               int x;
               scanf("%d",&x);
               if (x == 0) addedge(s,cal(i,j),1,0),addedge(m*n+cal(i,j),t,1,0),num++;
               else if (x & 1) addedge(s,cal(i,j),1,0),num++;
                     else addedge(n*m+cal(i,j),t,1,0);
           }

        for(int i = 1; i <= n-1;i++)
            for(int j = 1; j <= m;j++)
            {
                int x;
                scanf("%d",&x);
                addedge(cal(i,j),n*m+cal(i+1,j),1,x);
                addedge(cal(i+1,j),n*m+cal(i,j),1,x);
            }

         for(int i = 1; i <= n;i++)
            for(int j = 1; j <= m-1;j++)
            {
                int x;
                scanf("%d",&x);
                addedge(cal(i,j),n*m+cal(i,j+1),1,x);
                addedge(cal(i,j+1),n*m+cal(i,j),1,x);
            }
        int cost = 0;
        int flow = minCostMaxflow(s,t,cost);
        if (flow == num) printf("Case #%d: %d\n",++kase,cost);
        else printf("Case #%d: -1\n",++kase);
    }
    return 0;
}