bzoj4808 马:http://www.lydsy.com/JudgeOnline/problem.php?id=4808
把每个点和他所有能到达的点相连
最大独立集=总点数-最小覆盖集=总点数-最大匹配数
我是拆了点的 其实不拆点也可以
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct node
{
int x,y,next;
}a[410000];
int last[41000],len;
int match[81000],v[81000],c[210][210];
int t;
void build(int x,int y)
{
len++;
a[len].x=x;a[len].y=y;a[len].next=last[x];last[x]=len;
}
bool find(int x)
{
for (int k=last[x];k;k=a[k].next)
{
int y=a[k].y;
if (v[y]!=t)
{
v[y]=t;
if (match[y]==0||find(match[y])==1)
{
match[y]=x;
return 1;
}
}
}
return 0;
}
int main()
{
int n,m,sum=0;
scanf("%d%d",&n,&m);
memset(c,-1,sizeof(c));
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++) {scanf("%d",&c[i][j]);if (c[i][j]==0) sum++;}
for (int i=1;i<=n;i++)
{
for (int j=1;j<=m;j++)
{
if (c[i][j]==0)
{
int x=(i-1)*m+j;
if (i-1>=1&&j-2>=1&&c[i-1][j-2]==0) build(x,(i-2)*m+j-2+sum);
if (i+1<=n&&j-2>=1&&c[i+1][j-2]==0) build(x,i*m+j-2+sum);
if (i-1>=1&&j+2<=m&&c[i-1][j+2]==0) build(x,(i-2)*m+j+2+sum);
if (i+1<=n&&j+2<=m&&c[i+1][j+2]==0) build(x,i*m+j+2+sum);
if (i-2>=1&&j-1>=1&&c[i-2][j-1]==0) build(x,(i-3)*m+j-1+sum);
if (i-2>=1&&j+1<=m&&c[i-2][j+1]==0) build(x,(i-3)*m+j+1+sum);
if (i+2<=n&&j-1>=1&&c[i+2][j-1]==0) build(x,(i+1)*m+j-1+sum);
if (i+2<=n&&j+1<=m&&c[i+2][j+1]==0) build(x,(i+1)*m+j+1+sum);
}
}
}
t=0;
int ans=0;
for (int i=1;i<=n;i++)
{
for (int j=1;j<=m;j++)
{
if (c[i][j]==0)
{
t++;
if (find((i-1)*m+j)) ans++;
}
}
}
printf("%d\n",sum-ans/2);
return 0;
}