题目描述
传送门
题解
对于每个点拆点x->x’ 容量为该点的高度
S->x 有蜥蜴的点 容量为1
x’->T 到达某边界的距离
<d
<script type="math/tex" id="MathJax-Element-13">
x’->y x到y的距离
<=d
<script type="math/tex" id="MathJax-Element-14"><=d</script>,容量为x的高度。
代码
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
#define N 300003
#define inf 1000000000
using namespace std;
int dx[10]={0,1,0,-1},dy[10]={1,0,-1,0};
int sz,n,m,vis[23][23],mp[23][23],mp1[23][23],cnt,cur[N],a[23][23];
int tot,point[N],nxt[N],v[N],remain[N],deep[N],nowx,nowy,d,S,T;
bool pd;
void add(int x,int y,int z)
{
tot++; nxt[tot]=point[x]; point[x]=tot; v[tot]=y; remain[tot]=z;
tot++; nxt[tot]=point[y]; point[y]=tot; v[tot]=x; remain[tot]=0;
//cout<<x<<" "<<y<<" "<<z<<endl;
}
bool bfs(int s,int t)
{
for (int i=1;i<=t;i++) cur[i]=point[i];
for (int i=1;i<=t;i++) deep[i]=t+1;
deep[s]=0;
queue<int> p; p.push(s);
while (!p.empty()) {
int now=p.front(); p.pop();
for (int i=point[now];i!=-1;i=nxt[i])
if (deep[v[i]]==t+1&&remain[i])
deep[v[i]]=deep[now]+1,p.push(v[i]);
}
if (deep[t]==t+1) return false;
return true;
}
int dfs(int now,int t,int limit)
{
if(now==t||!limit) return limit;
int f,flow=0;
for (int i=cur[now];i!=-1;i=nxt[i]) {
cur[now]=i;
if (deep[v[i]]==deep[now]+1&&(f=dfs(v[i],t,min(limit,remain[i])))){
flow+=f; limit-=f;
remain[i]-=f; remain[i^1]+=f;
if (!limit) break;
}
}
return flow;
}
int dinic(int s,int t)
{
int ans=0;
while (bfs(s,t)) ans+=dfs(s,t,inf);
return ans;
}
int pow(int x){
return x*x;
}
bool check(int x1,int y1,int x2,int y2)
{
if (x1==x2&&y1==y2) return false;
return pow(x1-x2)+pow(y1-y2)<=pow(d);
}
int main()
{
freopen("a.in","r",stdin);
scanf("%d%d%d",&n,&m,&d);
S=1; T=n*m*2+2;
int sz=1; tot=-1;
memset(point,-1,sizeof(point));
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
mp[i][j]=++sz,mp1[i][j]=++sz;
for (int i=1;i<=n;i++){
char s[100]; scanf("%s",s+1);
for (int j=1;j<=m;j++){
int t=s[j]-'0'; a[i][j]=t;
if (t) add(mp[i][j],mp1[i][j],t);
}
}
for (int i=1;i<=n;i++){
char s[100]; scanf("%s",s+1);
for (int j=1;j<=m;j++)
if (s[j]=='L') add(S,mp[i][j],1),cnt++;
}
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++) {
if (i+d>n||j+d>m||i-d<=0||j-d<=0) add(mp1[i][j],T,inf);
for (int k=1;k<=n;k++)
for (int l=1;l<=m;l++)
if (check(i,j,k,l)&&a[i][j]&&a[k][l]) add(mp1[i][j],mp[k][l],a[i][j]);
}
printf("%d\n",cnt-dinic(S,T));
}