题目:
题解:
非常经典的题目了,好久之前的坑现在填啦
1A贺电
然后做一个最小割(最大流),割掉的相当于不选了,也就是这个权值不要了,最后用总的权值减去不要的权值
代码:
#include <queue>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define INF 1e9
const int N=10005;
int tot=-1,nxt[40*N],point[N*10],v[N*40],remind[N*40],cur[N*10],dis[N*10],id[105][105];
void addline(int x,int y,int cap)
{
++tot; nxt[tot]=point[x]; point[x]=tot; v[tot]=y; remind[tot]=cap;
++tot; nxt[tot]=point[y]; point[y]=tot; v[tot]=x; remind[tot]=0;
}
int dfs(int now,int t,int limit)
{
if (now==t || !limit) return limit;
int flow=0,f;
for (int i=cur[now];i!=-1;i=nxt[i])
{
cur[now]=i;
if (dis[v[i]]==dis[now]+1 && (f=dfs(v[i],t,min(limit,remind[i]))))
{
flow+=f;
limit-=f;
remind[i]-=f;
remind[i^1]+=f;
if (!limit) break;
}
}
return flow;
}
bool bfs(int s,int t)
{
queue<int>q;
q.push(s);
for (int i=s;i<=t;i++) cur[i]=point[i];
memset(dis,0x7f,sizeof(dis));
dis[s]=0;
while (!q.empty())
{
int x=q.front(); q.pop();
for (int i=point[x];i!=-1;i=nxt[i])
if (dis[v[i]]>INF && remind[i])
{q.push(v[i]); dis[v[i]]=dis[x]+1;}
}
if (dis[t]>INF) return 0;
return 1;
}
int dinic(int s,int t)
{
int ans=0;
while (bfs(s,t)) ans+=dfs(s,t,INF);
return ans;
}
int main()
{
int n,m,a,num=0,t=N*8+1,sum=0;
scanf("%d%d",&n,&m);
memset(nxt,-1,sizeof(nxt));memset(point,-1,sizeof(point));
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
id[i][j]=++num;
scanf("%d",&a);
sum+=a;
addline(0,id[i][j],a);
}
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
scanf("%d",&a);sum+=a;
addline(id[i][j],t,a);
}
for (int i=1;i<n;i++)
for (int j=1;j<=m;j++)
{
scanf("%d",&a);sum+=a;
++num;addline(0,num,a);
addline(num,id[i][j],INF);
addline(num,id[i+1][j],INF);
}
for (int i=1;i<n;i++)
for (int j=1;j<=m;j++)
{
scanf("%d",&a);sum+=a;
++num;addline(num,t,a);
addline(id[i][j],num,INF);
addline(id[i+1][j],num,INF);
}
for (int i=1;i<=n;i++)
for (int j=1;j<m;j++)
{
scanf("%d",&a);sum+=a;
++num;addline(0,num,a);
addline(num,id[i][j],INF);
addline(num,id[i][j+1],INF);
}
for (int i=1;i<=n;i++)
for (int j=1;j<m;j++)
{
scanf("%d",&a);sum+=a;
++num;addline(num,t,a);
addline(id[i][j],num,INF);
addline(id[i][j+1],num,INF);
}
printf("%d",sum-dinic(0,t));
}