题目:
题解:
可以发现马能攻击到的都是和自己颜色不一样的点,那么这道题和方格取数一样
记住空间要算清楚!
代码:
#include <queue>
#include <cstdio>
#include <cstring>
#include <iostream>
#define INF 1e9
using namespace std;
const int N=40005;
int id[205][205];
int tot=-1,nxt[N*16],point[N],v[N*16],remind[N*16],dis[N],cur[N],a[205][205];
int c[8][2]={{1,2},{2,1},{1,-2},{2,-1},{-1,2},{-2,1},{-1,-2},{-2,-1}};
void addline(int x,int y,int cap)
{
++tot; nxt[tot]=point[x]; point[x]=tot; v[tot]=y; remind[tot]=cap;
++tot; nxt[tot]=point[y]; point[y]=tot; v[tot]=x; remind[tot]=0;
}
int dfs(int now,int t,int limit)
{
if (now==t || !limit) return limit;
int flow=0,f;
for (int i=cur[now];i!=-1;i=nxt[i])
{
cur[now]=i;
if (dis[v[i]]==dis[now]+1 && (f=dfs(v[i],t,min(remind[i],limit))))
{
flow+=f;
limit-=f;
remind[i]-=f;
remind[i^1]+=f;
if (!limit) break;
}
}
return flow;
}
bool bfs(int s,int t)
{
queue<int>q;
q.push(s);
memset(dis,0x7f,sizeof(dis));
dis[s]=0;
for (int i=s;i<=t;i++) cur[i]=point[i];
while (!q.empty())
{
int x=q.front(); q.pop();
for (int i=point[x];i!=-1;i=nxt[i])
if (dis[v[i]]>INF && remind[i])
{q.push(v[i]); dis[v[i]]=dis[x]+1;}
}
return dis[t]<INF;
}
int dinic(int s,int t)
{
int ans=0;
while (bfs(s,t)) ans+=dfs(s,t,INF);
return ans;
}
int main()
{
int bl=0,wh=0,sum=0,n,m,x,y;
memset(nxt,-1,sizeof(nxt));
memset(point,-1,sizeof(point));
scanf("%d%d",&n,&m);
sum=n*n-m;
for (int i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
id[x][y]=-1;
}
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (id[i][j]!=-1)
{
if ((i+j)%2)//白点
id[i][j]=++wh;
else id[i][j]=++bl;
}
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (id[i][j]!=-1)
{
if ((i+j)%2) addline(id[i][j]+bl,wh+bl+1,1);
else
{
addline(0,id[i][j],1);
for (int k=0;k<=7;k++)
{
x=c[k][0]+i; y=c[k][1]+j;
if (x<1 || y<1 || x>n || y>n || id[x][y]==-1) continue;
addline(id[i][j],id[x][y]+bl,INF);
}
}
}
printf("%d",sum-dinic(0,wh+bl+1));
}