继续发二分图匹配的题。
本题比较容易想到要在能放的格子间建立二分图,但在实际中建图可能会比较麻烦。其实,可以在每个相邻的格子连两条反向的边,然后进行二分图匹配,所得的匹配数应是m*n-k.
(之前在网上看到的另一种思路,可以发现任何相邻两点的各自的横纵坐标之和必是一奇一偶,故可以以和为奇的点为左边的点,和为偶的点为右边的点,然后二分图匹配,此时所得的匹配数应是(m*n-k)/2).
const d:array[1..4,1..2]of integer=((1,0),(0,1),(0,-1),(-1,0));
var
m,n,k:longint;
a:array[1..2000,1..4]of longint;
t,match:array[1..2000]of longint;
h:array[1..2000]of boolean;
procedure init;
var
i,j,l,x,y,id1,id2:longint;
p:array[0..33,0..33]of boolean;
begin
fillchar(p,sizeof(p),0);
readln(m,n,k);
for i:=1 to k do
begin
readln(x,y);
p[y,x]:=true;
end;
for i:=1 to m do
for j:=1 to n do
if(not p[i,j])then
begin
id1:=n*(i-1)+j;
for l:=1 to 4 do
begin
x:=i+d[l,1];y:=j+d[l,2];
if(x>0)and(x<=m)and(y>0)and(y<=n)and(not p[x,y])then
begin
id2:=n*(x-1)+y;
inc(t[id2]);
a[id2][t[id2]]:=id1;
end;
end;
end;
end;
function check(v:longint):boolean;
var i:longint;
begin
for i:=1 to t[v] do
if(not h[a[v,i]])then
begin
h[a[v,i]]:=true;
if(match[a[v,i]]=0)or(check(match[a[v,i]]))then
begin
match[a[v,i]]:=v;
exit(true);
end;
end;
exit(false);
end;
procedure hungarian;
var i,ans:longint;
begin
ans:=0;
for i:=1 to m*n do
begin
fillchar(h,sizeof(h),0);
if(check(i))then inc(ans);
end;
if(ans=((m*n-k)))then writeln('YES') else writeln('NO');
end;
begin
init;
hungarian;
end.