”我整个人都最小割了“—hzwer..
分析:
s->A:cost[A文]+c[文][A][B]/2,s->B:cost[B文]+c[文][A][B]/2;
A->t:cost[A理]+c[理][A][B]/2,B->t:costB[理]+c[理][A][B]/2;
A<–>B:c[文][A][B]/2+c[理][A][B]/2
这样就会出现两种割,分别对应两个人同选和不同选。
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define T n*m+1
#define inf 0x7fffffff
using namespace std;
const int dx[4]={0,1,0,-1};
const int dy[4]={1,0,-1,0};
const int N=3e5+5;
const int M=1005;
typedef long long ll;
int sum=0;
int n,m;
int a[3505][3505],b[M][M],num[M][M],vis[3005][3005];
int head[N],next[N],go[N],val[N],q[N],dis[N];
int ans,tot=1;
inline void add(int x,int y,int z)
{
go[++tot]=y;
next[tot]=head[x];
val[tot]=z;
head[x]=tot;
}
inline void ins(int x,int y,int z)
{
add(x,y,z);
add(y,x,0);
}
inline void ins2(int x,int y,int z)
{
add(x,y,z);
add(y,x,z);
}
inline bool bfs()
{
int t=0,w=1;
memset(dis,-1,sizeof(dis));
dis[0]=0;
q[1]=0;
while (t<w)
{
int x=q[++t];
for(int i=head[x];i;i=next[i])
{
int v=go[i];
if (val[i]&&dis[v]==-1)
{
dis[v]=dis[x]+1;
q[++w]=v;
}
}
}
return dis[T]!=-1;
}
inline int dfs(int x,int f)
{
if (x==T)return f;
int w,used=0;
for(int i=head[x];i;i=next[i])
{
int v=go[i];
if (val[i]&&dis[v]==dis[x]+1)
{
w=f-used;
w=dfs(v,min(w,val[i]));
val[i]-=w;
val[i^1]+=w;
used+=w;
if (used==f)return f;
}
}
if (!used)dis[x]=-1;
return used;
}
inline void dinic()
{
while (bfs())ans+=dfs(0,inf);
}
inline void build()
{
int x;
fo(i,1,n-1)
fo(j,1,m)
{
scanf("%d",&x);
sum+=x;
a[i][j]+=x,a[i+1][j]+=x;
ins2(num[i][j],num[i+1][j],x);
}
fo(i,1,n-1)
fo(j,1,m)
{
scanf("%d",&x);
sum+=x;
b[i][j]+=x,b[i+1][j]+=x;
ins2(num[i][j],num[i+1][j],x);
}
fo(i,1,n)
fo(j,1,m-1)
{
scanf("%d",&x);
sum+=x;
a[i][j]+=x,a[i][j+1]+=x;
ins2(num[i][j],num[i][j+1],x);
}
fo(i,1,n)
fo(j,1,m-1)
{
scanf("%d",&x);
sum+=x;
b[i][j]+=x,b[i][j+1]+=x;
ins2(num[i][j],num[i][j+1],x);
}
fo(i,1,n)
fo(j,1,m)
{
ins(0,num[i][j],a[i][j]);
ins(num[i][j],T,b[i][j]);
}
}
int main()
{
scanf("%d%d",&n,&m);
fo(i,1,n)
fo(j,1,m)
{
scanf("%d",&a[i][j]);
sum+=a[i][j],a[i][j]<<=1;
}
fo(i,1,n)
fo(j,1,m)
{
scanf("%d",&b[i][j]);
sum+=b[i][j],b[i][j]<<=1;
}
fo(i,1,n)
fo(j,1,m)num[i][j]=(i-1)*m+j;
build();
dinic();
printf("%d\n",sum-(ans>>1));
}