【BZOJ2127】happiness（最小割）

传送门

---

题解：

考虑拆点，那么建图非常容易，发现一个人选文和选理之间的边为INF，可以缩成一个点。

---

代码：

#include<bits/stdc++.h>
#define ll long long
#define re register 
#define cs const

using std::cerr;
using std::cout;

cs int N=107,M=N*N;
int S,T,tot,id[N][N];
int a[N][N],b[N][N],tp[N][N],sum;

struct edge{int to,rev,cap;};
typedef std::vector<edge>::iterator iter;
std::vector<edge> G[M];iter cur[M];
inline void adde(int u,int v,int uv,int vu=0){
	G[u].push_back((edge){v,G[v].size(),uv});
	G[v].push_back((edge){u,G[u].size()-1,vu});
}

int lev[M],gap[M],finish;
inline void BFS(){
	std::queue<int> q;q.push(T);lev[T]=gap[T]=1;
	while(!q.empty()){
		int u=q.front();q.pop();cur[u]=G[u].begin();
		for(iter e=G[u].begin();e!=G[u].end();++e)
		if(!lev[e->to]){
			lev[e->to]=lev[u]+1;
			++gap[lev[e->to]];
			q.push(e->to);
		}
	}
	finish=lev[S]==0;
}

int dfs(int u,int flow){
	if(u==T)return flow;
	int ans=0;
	for(iter &e=cur[u];e!=G[u].end();++e)
	if(e->cap&&lev[e->to]+1==lev[u]){
		int delta=dfs(e->to,std::min(flow-ans,e->cap));
		if(delta){
			e->cap-=delta;
			G[e->to][e->rev].cap+=delta;
			if((ans+=delta)==flow)return ans;
		}
	}
	if(!--gap[lev[u]++])finish=true;
	++gap[lev[u]],cur[u]=G[u].begin();
	return ans;
}

inline int Flow(){
	int flow=0;BFS();
	while(!finish)flow+=dfs(S,0x3f3f3f3f);
	return flow;
}

int n,m;
signed main(){
#ifdef zxyoi
	freopen("happiness.in","r",stdin);
#endif
	scanf("%d%d",&n,&m);S=1,T=tot=2;
	for(int re i=1;i<=n;++i)
	for(int re j=1;j<=m;++j)scanf("%d",&a[i][j]),sum+=a[i][j],a[i][j]<<=1;
	for(int re i=1;i<=n;++i)
	for(int re j=1;j<=m;++j)scanf("%d",&b[i][j]),sum+=b[i][j],b[i][j]<<=1;
	for(int re i=1;i<=n;++i)
	for(int re j=1;j<=m;++j)id[i][j]=++tot;
	for(int re i=1;i<=n-1;++i)
	for(int re j=1;j<=m;++j){
		int val;scanf("%d",&val);sum+=val;
		a[i][j]+=val,a[i+1][j]+=val;tp[i][j]=val;
	}
	for(int re i=1;i<=n-1;++i)
	for(int re j=1;j<=m;++j){
		int val;scanf("%d",&val);sum+=val;
		b[i][j]+=val,b[i+1][j]+=val;val+=tp[i][j];
		adde(id[i][j],id[i+1][j],val,val);
	}
	for(int re i=1;i<=n;++i)
	for(int re j=1;j<=m-1;++j){
		int val;scanf("%d",&val);sum+=val;
		a[i][j]+=val,a[i][j+1]+=val;tp[i][j]=val;
	}
	for(int re i=1;i<=n;++i)
	for(int re j=1;j<=m-1;++j){
		int val;scanf("%d",&val);sum+=val;
		b[i][j]+=val,b[i][j+1]+=val;val+=tp[i][j];
		adde(id[i][j],id[i][j+1],val,val);
	}
	for(int re i=1;i<=n;++i)
	for(int re j=1;j<=m;++j)
	adde(S,id[i][j],a[i][j]),adde(id[i][j],T,b[i][j]);
	cout<<sum-(Flow()>>1)<<"\n";
	return 0;
}