计蒜客习题-棋盘上的马 最大点独立集

看见棋盘直接黑白染色，发现马只会跳到属于二分图另一侧的点上

给每个点按坐标编号 只连接编号为奇数的点到编号为偶数的点的边 最后点数（n*n-m）减去最大匹配数 就是最大点独立集的点数

如图 每个奇数位置的点可以贡献8条有向边  所以总边数应该是点数*8/2  并不会炸 暴力连边建图即可

 

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
const int maxn = 207, maxm = 40029;
struct edge {
	int v, next;
}e[320070];
int p[maxm], eid = 0;
int n, m;
inline void init() {
	memset(p, -1, sizeof(p));
	eid = 0;
}
inline void ins(int u,int v) {
	e[eid].v = v; e[eid].next = p[u]; p[u] = eid++;
}
int num(int x, int y) {
	return (x - 1)*n + y;
}
bool vis[maxm];
bool node[maxm];
int link[maxm];
bool dfs(int u) {
	int v;
	for (int i = p[u]; ~i; i = e[i].next) {
		v = e[i].v;
		if (!vis[v]) {
			vis[v] = true;
			if (link[v] == -1 || dfs(link[v]))
			{
				link[v] = u;
				return true;
			}
		}
	}
	return false;
}
int hungary(int s) {
	int res = 0;
	if (!node[s]) {
		memset(vis, false, sizeof(vis));
		res += dfs(s);
	}
	return res;
}
int nxt[8][2] = { {-1,-2},{1,-2},{-2,-1},{2,-1},{1,2},{-1,2},{2,1},{-2,1} };
int dx, dy;

inline int read() {
	char c = getchar();
	int s = 0, f = 1;
	while (c < '0' || c > '9') {
		if (c == '-') f = -1;
		c = getchar();
	}
	while (c >= '0'&&c <= '9') {
		s = s * 10 + c - 48;
		c = getchar();
	}
	return s*f;
}
int main() {
	n = read(); m = read();
	for (int i = 1; i <= m;i++) {		//这里不能改变m的值
		node[num(read(),read())] = true;
	}
	init();
	for (int i = 1; i <= n; i++) {			//连边
		for (int j = 1; j <= n; j++) {
			int t = num(i, j);
			if (((i+j)&1)&&!node[t]) {					
				for (int k = 0; k < 8; k++) {
					dx = i + nxt[k][0];
					dy = j + nxt[k][1];
					if (dx<1 || dx>n || dy<1 || dy>n) continue;
					if (node[num(dx,dy)]) continue;
					ins(num(i,j), num(dx,dy));
				}
			}
		}
	}
	int ans = 0;
	memset(link, -1, sizeof(link));
	for(int i=1;i<=n;i++)
		for (int j = 1; j <= n; j++)
		{
			if (!node[num(i,j)])
				ans += hungary(num(i, j));
		}
	printf("%d",n*n-m-ans);
	//getchar();
	return 0;
}