题目
分析
那么这道题显然是一个求二分图最大独立集的题目,但是怎样把点分成两份更优呢,可以发现按照行的奇偶性挺不错的,然后最大独立集=总点数-最大流,所以跑一遍网络流dinic就可以了
代码
#include <cstdio>
#include <cctype>
#include <queue>
#define rr register
using namespace std;
struct node{int y,w,next;}e[400001];
const int dx[8]={1,1,-1,-1,3,3,-3,-3},dy[8]={3,-3,3,-3,1,-1,1,-1};
int n,m,k=1,ans,v[201][201],s,t,ls[40011],tot,dis[40011];
inline signed iut(){
rr int ans=0; rr char c=getchar();
while (!isdigit(c)) c=getchar();
while (isdigit(c)) ans=(ans<<3)+(ans<<1)+(c^48),c=getchar();
return ans;
}
inline void add(int x,int y,int w){
e[++k]=(node){y,w,ls[x]}; ls[x]=k;
e[++k]=(node){x,0,ls[y]}; ls[y]=k;
}
inline signed bfs(int s){
for (rr int i=1;i<=t;++i) dis[i]=0;
rr queue<int>q; q.push(s); dis[s]=1;
while (q.size()){
rr int x=q.front(); q.pop();
for (rr int i=ls[x];i;i=e[i].next)
if (e[i].w>0&&!dis[e[i].y]){
dis[e[i].y]=dis[x]+1;
if (e[i].y==t) return 1;
q.push(e[i].y);
}
}
return 0;
}
inline signed dfs(int x,int now){
if (x==t||!now) return now;
rr int rest=0,f;
for (rr int i=ls[x];i;i=e[i].next)
if (e[i].w>0&&dis[e[i].y]==dis[x]+1){
rest+=(f=dfs(e[i].y,min(now-rest,e[i].w)));
e[i].w-=f; e[i^1].w+=f;
if (now==rest) return rest;
}
if (!rest) dis[x]=0;
return rest;
}
signed main(){
n=iut(); m=iut(); ans=n*m-iut();
for (rr int i=ans+1;i<=n*m;++i) v[iut()][iut()]=-1;
for (rr int i=1;i<=n;++i)
for (rr int j=1;j<=m;++j)
if (~v[i][j]) v[i][j]=++tot;
s=tot+1,t=s+1;
for (rr int i=1;i<=n;++i)
for (rr int j=1;j<=m;++j)
if (~v[i][j]){
if (i&1) add(s,v[i][j],1);
else add(v[i][j],t,1);
if (i&1) for (rr int t=0;t<8;++t)
if (i+dx[t]>0&&i+dx[t]<=n&&j+dy[t]>0&&j+dy[t]<=m&&~v[i+dx[t]][j+dy[t]])
add(v[i][j],v[i+dx[t]][j+dy[t]],1);
}
while (bfs(s)) ans-=dfs(s,23333333);
return !printf("%d",ans);
}