【Codevs 2171 棋盘覆盖 】 二分图最大匹配

CODEVS 2171

题意 给你一个 n * n 的棋盘 棋盘中删除 m 个点 问你能最多放进去多少个 1*2 的牌子

做法 二分图关键是找到一个 0元素 也就是对两个点集合来说 点集合直接没变

                         还要找到一个 1元素 也就是这两个点集合之间 有边相连

我们知道 因为1*2 所以一个格子肯定要和相邻的格子相连 如果我们根据坐标之和奇偶性染色 那么也就是白格子(偶)作为左边的点 黑格子(奇)作为右边的点 所有白点连一个黑点（满足 1元素） 然后点与点直接不连即可 （满足 0元素）

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
const int MAX_N = 125;
const int MAX_M = 40025;
bool vis[MAX_N][MAX_N],use[10125];
int n,dir[4][2] = {1,0,0,1,-1,0,0,-1},p[10125],eid,girl[10125];
bool ok(int x,int y)
{
    if(x>=1&&x<=n&&y>=1&&y<=n) return true;
    return false;
}
void init()
{
    memset(p,-1,sizeof(p));
    eid = 0;
}
struct edge
{
    int v,next;
}e[MAX_M];
void add(int u,int v)
{
    e[eid].v = v;
    e[eid].next = p[u];
    p[u] = eid++;
}
bool dfs(int u)
{
    for(int i = p[u];i+1;i=e[i].next)
    {
        int to = e[i].v;
        if(!use[to])
        {
            use[to] = true;
            if(!girl[to]||dfs(girl[to]))
            {
                girl[to] = u;
                return true;
            }
        }
    }
    return false;
}
int main()
{

    int m,a,b,ans = 0;
    init();
    scanf("%d%d",&n,&m);
    for(int i = 1;i<=m;++i)
    {
        scanf("%d%d",&a,&b);
        vis[a][b] = true;
    }
    for(int i = 1;i<=n;++i)
    {
        for(int j = 1;j<=n;++j)
        {
            for(int k = 0;k<4;++k)
            {
                if(vis[i][j]) continue;
                int x = i + dir[k][0], y = j + dir[k][1];
                if(!ok(x,y)||vis[x][y]||(i+j)%2!=0) continue;
                add((i-1)*n+j,(x-1)*n+y);
            }
        }
    }
    for(int i = 1;i<=n;++i)
    {
        for(int j = 1;j<=n;++j)
        {
            memset(use,false,sizeof(use));
            if(dfs((i-1)*n+j)) ans++;
        }
    }
    printf("%d\n",ans);

    return 0;
}