2127: happiness

观察数据范围很好想到用网络流来做
令选文科为ai,选理科为bi，同时选文科得到价值ki,同时选理科得到价值pi
容易建图

然后发现这样点数以及边数过多会导致tle..
考虑优化…
发现ki实际上是在si,sj均被割掉的情况下才会产生价值.
pi同理,那么思考发现：
在i,j间连边(pi+ki)/2，ai + ki/2,bi+pi/2,aj+ki/2,bj+ki/2也可以达到相同效果

搞定…
c++代码如下：

#include<bits/stdc++.h>
#define id(i,j) ((i - 1) * m + j)
#define rep(i,x,y) for(register int i = x ; i <= y;++ i)
#define repd(i,x,y) for(register int i = x ; i >= y;-- i)
using namespace std;
typedef long long ll;
template<typename T>inline void read(T&x)
{
    x = 0;char c;int sign = 1;
    do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
    do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}

const int N = 1e4+50,M = 4e5+500;const ll inf = 1e16;
ll ans,sum,a[N],b[N],c[N],d[N],f[M];
int n,m,s,t,D[N],cur[N];
int tot,head[N],nxt[M],to[M];

inline void add(int x,int y,ll flow)
{
    nxt[tot] = head[x];
    f[tot] = flow;
    to[tot] = y;
    head[x] = tot++;
}

inline bool bfs()
{
    memset(D,0,sizeof D);
    queue<int> q;
    q.push(s); D[s] = 1;
    while(!q.empty())
    {
        int x = q.front(); q.pop();cur[x] = head[x];
        for(register int i = head[x]; ~i ;i = nxt[i])
            if(f[i] && !D[to[i]])
            {
                D[to[i]] = D[x] + 1;
                q.push(to[i]);
            }
    }
    return D[t];
}

ll dfs(int x,ll w)
{
    if(!w || x == t) return w;
    ll F,flow = 0;
    for(register int&i = cur[x];~i;i=nxt[i])
        if(D[to[i]] == D[x] + 1 && (F = dfs(to[i],min(w,f[i])))){
            flow += F;w -= F;
            f[i] -= F;f[i ^ 1] += F;
            if(!w) break; 
    }
    return flow;
}

int main()
{
    memset(head,-1,sizeof head);
    read(n); read(m);
    t = n*m + 1;
    rep(i,1,n) rep(j,1,m)
    {
        read(a[id(i,j)]); 
        a[id(i,j)] *= 2;
    }

    rep(i,1,n) rep(j,1,m)
    {
        read(b[id(i,j)]);
        b[id(i,j)] *= 2;
    }

    rep(i,2,n) rep(j,1,m)
    {
        read(c[id(i,j)]);
        a[id(i,j)] += c[id(i,j)];
        a[id(i-1,j)] += c[id(i,j)];
    }

    rep(i,2,n) rep(j,1,m)
    {
        int x; read(x);
        c[id(i,j)] += x;
        b[id(i,j)] += x;
        b[id(i - 1,j)] += x;

        add(id(i,j),id(i - 1,j),c[id(i,j)]);
        add(id(i - 1,j),id(i,j),0);
        add(id(i - 1,j),id(i,j),c[id(i,j)]);
        add(id(i,j),id(i - 1,j),0);
    }

    rep(i,1,n) rep(j,2,m)
    {
        int x; read(d[id(i,j)]);
        a[id(i,j)] += d[id(i,j)];
        a[id(i,j - 1)] += d[id(i,j)];
    }

    rep(i,1,n) rep(j,2,m)
    {
        int x; read(x);
        d[id(i,j)] += x;
        b[id(i,j)] += x;
        b[id(i,j - 1)] += x;
        add(id(i,j),id(i,j - 1),d[id(i,j)]);
        add(id(i,j - 1),id(i,j),0);
        add(id(i,j - 1),id(i,j),d[id(i,j)]);
        add(id(i,j),id(i,j - 1),0);
    }
    int p = n*m;
    rep(i,1,p)
    {
        sum += a[i] + b[i];
        add(s,i,a[i]); add(i,s,0);
        add(i,t,b[i]); add(t,i,0);
    }

    while(bfs()) ans += dfs(s,inf);
    cout << (sum - ans)/2 << endl;

    return 0;
}