拆点+建图+源点汇点,再用最大流ISAP跑一边就可以
建图还是麻烦一些,然后输出要注意一下格式,因为这个WA两次
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cctype>
using namespace std;
typedef long long ll;
const int N=800+10;
const int M=1e5+10;
const int INF=0x7f7f7f7f;
struct Edge
{
int to,nxt,cap,flow;
}edge[M];
int tot,first[N];
void addedge(int u,int v,int w,int rw=0)
{
edge[tot].to=v;edge[tot].cap=w;edge[tot].flow=0;
edge[tot].nxt=first[u];first[u]=tot++;
edge[tot].to=u;edge[tot].cap=rw;edge[tot].flow=0;
edge[tot].nxt=first[v];first[v]=tot++;
}
void init()
{
tot=0;
memset(first,-1,sizeof(first));
}
int gap[N],dep[N],cur[N];
int Q[N],S[N];
void bfs(int s)
{
memset(dep,-1,sizeof(dep));
memset(gap,0,sizeof(gap));
int q0=0,q1=0;
Q[q1++]=s;
dep[s]=0;
gap[0]=1;
while(q0<q1)
{
int u=Q[q0++];
for(int i=first[u];i!=-1;i=edge[i].nxt)
{
int v=edge[i].to;
if(dep[v]!=-1) continue;
dep[v]=dep[u]+1;
gap[dep[v]]++;
Q[q1++]=v;
}
}
}
int sap(int s,int t,int n)
{
int ans=0;
bfs(t);
memcpy(cur,first,sizeof(first));
int u=s;
int top=0;
while(dep[s]<n)
{
if(u==t)
{
int Min=INF;
int inser;
for(int i=0;i<top;i++)
if(Min>edge[S[i]].cap-edge[S[i]].flow)
{
Min=edge[S[i]].cap-edge[S[i]].flow;
inser=i;
}
for(int i=0;i<top;i++)
{
edge[S[i]].flow+=Min;
edge[S[i]^1].flow-=Min;
}
ans+=Min;
top=inser;
u=edge[S[top]^1].to;
}
bool flag=false;
int v;
for(int i=cur[u];i!=-1;i=edge[i].nxt)
{
v=edge[i].to;
if(edge[i].cap-edge[i].flow&&dep[v]+1==dep[u])
{
flag=true;
cur[u]=S[top++]=i;
break;
}
}
if(flag)
{
u=v;
continue;
}
gap[dep[u]]--;
if(!gap[dep[u]]) return ans;
int Min=n;
for(int i=first[u];i!=-1;i=edge[i].nxt)
if(edge[i].cap-edge[i].flow&&Min>dep[edge[i].to])
{
Min=dep[edge[i].to];
cur[u]=i;
}
dep[u]=Min+1;
gap[dep[u]]++;
if(u!=s) u=edge[S[--top]^1].to;
}
return ans;
}
char c[N][N];
int main()
{
int T,kase=0;
int n,m,d;
scanf("%d",&T);
while(T--)
{
init();
int ans=0;
scanf("%d%d",&n,&d);
for(int i=0;i<n;i++)
scanf("%s",c[i]);
m=strlen(c[0]);
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
addedge(m*i+j,i*m+j+n*m,c[i][j]-'0');
for(int i=0;i<n;i++)
scanf("%s",c[i]);
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
if(c[i][j]=='L')
addedge(2*n*m,i*m+j,1),ans++;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
{
if(i+1<=d||n-i<=d||j+1<=d||m-j<=d)
addedge(i*m+j+n*m,2*n*m+1,INF);
for(int p=0;p<n;p++)
for(int q=0;q<m;q++)
{
if(i==p&&j==q) continue;
if(abs(p-i)+abs(q-j)<=d)
addedge(i*m+j+n*m,p*m+q,INF);
}
}
ans-=sap(2*n*m,2*n*m+1,2*n*m+2);
printf("Case #%d: ",++kase);
if(ans) printf("%d",ans);
else printf("no");
if(ans<2) printf(" lizard was left behind.\n");
else printf(" lizards were left behind.\n");
}
return 0;
}