【SCOI2007】【最大流】蜥蜴

非常直观的建图方法。

对于有蜥蜴的格子，从源点向该点连一条容量为1的边，对于每个石柱拆点u,u'

连边u -> u'，容量为石柱高度

对于任意两个可以到达的石柱u,v，连边u' -> v，容量为inf

对于任意一个可以跳出边界的石柱，连边u' -> t，容量为inf

做一次最大流即为最多能逃出的蜥蜴数量

代码:

#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
const int maxp = 50;
const int maxn = 5000;
const int maxm = 100000;
const int inf = 0x3f3f3f3f;
struct Edge
{
	int pos,c;
	int next;
}E[maxm];
int map[maxp][maxp],head[maxn];
int dis[maxn],gap[maxn],cur[maxn],pre[maxn];
bool flag[maxp][maxp];
int s,t,nodenum,NE = 0;
int r,c,d,com = 0; 
void init()
{
	freopen("bzoj1066.in","r",stdin);
	freopen("bzoj1066.out","w",stdout);
}

void add(int u,int v,int c)
{
	E[NE].pos = v;E[NE].c = c;
	E[NE].next = head[u];head[u] = NE++;
	E[NE].pos = u;E[NE].c = 0;
	E[NE].next = head[v];head[v] = NE++;
}

double dist(int x0,int y0,int x1,int y1)
{
	return sqrt((x0 - x1) * (x0 - x1) + (y0 - y1) * (y0 - y1));
}

void checkmin(int &a,int b)
{
	if(a == -1 || a > b)a = b;
}

void readdata()
{
	memset(map,0,sizeof(map));
	memset(flag,false,sizeof(flag));
	scanf("%d%d%d\n",&r,&c,&d);
	for(int i = 1;i <= r;i++)
	{
		for(int j = 1;j <= c;j++)
		{
			char tmp;
			scanf("%c",&tmp);
			map[i][j] = tmp - '0';
		}
		scanf("\n");
	}
	for(int i = 1;i <= r;i++)
	{
		for(int j = 1;j <= c;j++)
		{
			char tmp;
			scanf("%c",&tmp);
			if(tmp == 'L')flag[i][j] = true,com++;
		}
		scanf("\n");
	}
}

void build_map()
{
	memset(E,0,sizeof(E));
	memset(head,-1,sizeof(head));
	s = 0,t = r * c * 2 + 1;
	nodenum = t + 1;
	for(int i = 1;i <= r;i++)
	{
		for(int j = 1;j <= c;j++)
		{
			if(flag[i][j])add(s,(i - 1) * c + j,1);
			if(map[i][j] != 0)
			{
				add((i - 1) * c + j,(i - 1) * c + j + r * c,map[i][j]);
				for(int nx = 1;nx <= r;nx++)
				{
					for(int ny = 1;ny <= c;ny++)
					{
						if(!map[nx][ny] || (i == nx && j == ny))continue;
						if(dist(i,j,nx,ny) <= (double)d)add((i - 1) * c + j + r * c,(nx - 1) * c + ny,inf);
					}
				}
				if(i <= d || i > r - d || j <= d || j > c - d)add((i - 1) * c + j + r * c,t,inf);
			}
		}
	}
}

int sap()
{
	memset(gap,0,sizeof(gap));
	memset(dis,0,sizeof(dis));
	for(int i = s;i <= t;i++)cur[i] = head[i];
	int u = pre[s] = s,maxflow = 0,aug = -1;
	gap[0] = nodenum;
	while(dis[s] < nodenum)
	{
loop:   for(int &i = cur[u];i != -1;i = E[i].next)
		{
			int v = E[i].pos;
			if(E[i].c && dis[u] == dis[v] + 1)
			{
				checkmin(aug,E[i].c);
				pre[v] = u;
				u = v;
				if(v == t)
				{
					maxflow += aug;
					for(u = pre[u];v != s;v = u,u = pre[u])
					{
						E[cur[u]].c -= aug;
						E[cur[u]^1].c += aug;
					}
					aug = -1;
				}
				goto loop;
			}
		}
		int mind = nodenum;
		for(int i = head[u];i != -1;i = E[i].next)
		{
			int v = E[i].pos;
			if(E[i].c && (mind > dis[v]))
			{
				mind = dis[v];
				cur[u] = i;
			}
		}
		if((--gap[dis[u]]) == 0)break;
		gap[dis[u] = mind + 1]++;
		u = pre[u];
	}
	return maxflow;
}

void solve()
{
	build_map();
	int ans = com - sap();
	printf("%d\n",ans);
}

int main()
{
	init();
	readdata();
	solve();
	return 0;
}