|
回帖奖励 +1
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
int e[309][309];
int matchx[309][309]={0},book[309][309],matchy[309][309]={0},sum=0,n,m,t;
int dx[8]={1,2,2,1,-1,-2,-2,-1};
int dy[8]={-2,-1,1,2,2,1,-1,-2};
int dfs(int x,int y)
{
for(int i=0;i<=7;i++)
{
int xx=x+dx[i];
int yy=y+dy[i];
if(xx>=1 && xx<=n && yy>=1 && yy<=m && book[xx][yy]==0 && e[xx][yy]!=1)
{
book[xx][yy]=1;
if(matchx[xx][yy]==0 || dfs(matchx[xx][yy],matchy[xx][yy]))
{
matchx[xx][yy]=x;
matchy[xx][yy]=y;
return 1;
}
}
}
return 0;
}
int main()
{
scanf("%d%d%d",&n,&m,&t);
for(int i=1;i<=t;i++)
{
int d,f;
scanf("%d%d",&d,&f);
e[d][f]=1;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
memset(book,0,sizeof(book));
if(e[i][j]==1)
{
continue;
}
if(dfs(i,j))
{
sum++;
}
}
}
printf("%d",n*m-t-sum/2);
return 0;
} |
|