游戏
题目描述
样例输入
4 4
# * * *
* # * *
* * # *
x x x #
样例输出
5
数据范围
题解
首先,我们将整个网格的每一行以硬石头分成若干个由软石头和空地组成的连通块,并给他们标上号,把样例分成若干块,分法如下:
同样的,我们竖的也做一遍分块和编号,如下:
现在,我们将每一块空地对应的横块向它对应的竖块连一条有向边,因为如果在某个空地放了一个炸弹,那么就不能允许别的横块和竖块跟炸弹所在的横块和竖块有交叉,这样就满足了二分性质,跑一次二分图最大匹配,答案即为最大匹配数。
二分图匹配可以用匈牙利算法进行匹配。
Code(Pascal)
var
mb:set of char;
gs:array[0..50,0..50,1..2] of longint;
bz:array[0..50,0..50] of longint;
yl:array[0..50,0..50] of char;
n,m,j,k,l,i,o,p,kd,ans:longint;
pp:array[0..50000] of longint;
used:array[0..50000] of boolean;
bj:array[0..2500,0..2500] of longint;
procedure add(x,y:longint);
begin
inc(bj[x,0]);
bj[x,bj[x,0]]:=y;
end;
function run(o:longint):boolean;
var
i:longint;
begin
for i:=1 to bj[o,0] do
if used[bj[o,i]]=true then
begin
used[bj[o,i]]:=false;
if run(pp[bj[o,i]]) or (pp[bj[o,i]]=0) then
begin
pp[bj[o,i]]:=o;
exit(true);
end;
end;
exit(false);
end;
begin
mb:=['x','*'];
readln(n,m);
for i:=1 to n do
begin
for l:=1 to m do
read(yl[i,l]);
readln;
end;
o:=0;
for i:=1 to n do
begin
inc(o);
yl[i,0]:='#';
for l:=1 to m do
begin
if (yl[i,l]='#') and (yl[i,l-1]<>'#') then inc(o);
gs[i,l,1]:=o;
end;
end;
kd:=o;
for l:=1 to m do
begin
inc(o);
yl[l,0]:='#';
for i:=1 to n do
begin
if (yl[i,l]='#') and (yl[i-1,l]<>'#') then inc(o);
gs[i,l,2]:=o;
end;
end;
for i:=1 to n do
for l:=1 to m do
if yl[i,l]='*' then
add(gs[i,l,1],gs[i,l,2]);
ans:=0;
for i:=1 to kd do
begin
for l:=kd to o do
used[l]:=true;
if run(i) then inc(ans);
end;
writeln(ans);
end.