题目分析:
在一个n*n个方格的国际象棋棋盘上,马(骑士)可以攻击的棋盘方格如图所示。棋盘上某些方格设置了障碍,骑士不得进入。
思路分析:
要注意国际象棋棋盘骑士的走法:日字走法,先向左(或右)走一格,再向上(或下)走两格;或向左(向右)走两格,再向上(或下)走一格。
二分图最大独立集,转化为二分图最大匹配,从而用最大流解决。
①:把棋盘黑白染色,是相邻的格子颜色不同(可利用奇偶性),把所有的黑色格子看做二分图X集合中顶点,白色格子看做Y集合顶点。
②:设立一个源点s,从s向X集合中的每一个顶点连一条有向边,容量为1;
③:设立一个汇点t,从Y集合中的每一个顶点向t连一条有向边,容量为1;
④:从每个黑色格子向骑士一步能攻击到的白色格子连接一条容量为无穷大的有向边。
代码实现:
#include<cstdio>
#include<cstring>
#include<queue>
#include<iostream>
#define Max(a,b) ((a)>(b)?(a):(b))
using namespace std;
const int N=40010, M=800010, INF= 0x3f3f3f3f;
int n, m, s, t, top;
int head[N], gap[N], cur[N], dis[N], pre[N], flag[N], vis[N], mp[210][210];
int dx[]={-2,-1,1,2,2,1,-1,-2},dy[]={1,2,2,1,-1,-2,-2,-1};
struct Edge{
int to, next, flow;
Edge(int _to = 0, int _next = 0, int _flow = 0):to(_to), next(_next), flow(_flow){}
}edge[M];
void Addedge(int from, int to, int flow){
edge[top] = Edge(to, head[from], flow);
head[from] = top++;
edge[top] = Edge(from, head[to], 0);
head[to] = top++;
}
void Bfs(){
queue<int> q;
memset(gap, 0, sizeof(gap));
memset(dis, -1, sizeof(dis));
dis[t] = 0, gap[0] = 1; q.push(t);
while(!q.empty()){
int u = q.front(); q.pop();
for(int i = head[u]; i+1; i = edge[i].next){
if(dis[edge[i].to] == -1){
dis[edge[i].to] = dis[u] + 1;
gap[dis[edge[i].to]] ++;
q.push(edge[i].to);
}
}
}
}
int Sap(){
Bfs();
memset(pre, -1, sizeof(pre));
for(int i = s; i <= t; ++i) cur[i] = head[i];
int u = s, cur_flow, max_flow = 0, neck, tmp;
while(dis[s] <= t){
if(u == t){
cur_flow = INF;
for(int i = s; i != t; i = edge[cur[i]].to){
if(cur_flow > edge[cur[i]].flow){
cur_flow = edge[cur[i]].flow;
neck = i;
}
}
for(int i = s; i != t; i = edge[cur[i]].to){
tmp = cur[i];
edge[tmp].flow -= cur_flow;
edge[tmp^1].flow += cur_flow;
}
max_flow += cur_flow;
u = neck;
}
int i;
for(i = cur[u]; i + 1; i = edge[i].next)
if(edge[i].flow && dis[u] == dis[edge[i].to] + 1) break;
if(i != -1){
cur[u] = i;
pre[edge[i].to] = u;
u = edge[i].to;
}else{
if(--gap[dis[u]] == 0) break;
cur[u] = head[u];
int mindis = t;
for(int i = head[u]; i + 1; i = edge[i].next)
if(edge[i].flow && mindis > dis[edge[i].to]) mindis = dis[edge[i].to];
dis[u] = mindis + 1;
gap[dis[u]]++;
if(u != s) u = pre[u];
}
}
return max_flow;
}
int main(){
freopen("knight.in", "r", stdin);
freopen("knight.out", "w", stdout);
scanf("%d%d", &n, &m);
memset(head, -1, sizeof(head));
memset(mp, 0, sizeof(mp));
top = s = 0; t = n * n + 1;
int sum = 0, a, b;
for(int i = 1; i <= m; ++i){
scanf("%d%d", &a, &b);
mp[a][b] = -1;
}
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j){
if(mp[i][j] == -1) continue;
sum++;
if((i + j) % 2 == 0) Addedge(s, (i-1)*n+j, 1);
else Addedge((i-1)*n+j, t, 1);
}
}
int x, y;
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j){
if((i + j) % 2 || mp[i][j] == -1) continue;
for(int k = 0; k < 8; ++k){
x = i + dx[k], y = j + dy[k];
if(x < 1 || x > n || y < 1 || y > n || mp[i][j] == -1) continue;
if((i + j) % 2 == 0) Addedge((i-1)*n+j, (x-1)*n+y, INF);
else Addedge((x-1)*n+y, (i-1)*n+j, INF);
}
}
}
int res = Sap();
printf("%d\n", sum - res);
}