[BZOJ 1191][HNOI 2006]超级英雄Hero(二分图最大匹配)

题目链接：http://www.lydsy.com:808/JudgeOnline/problem.php?id=1191

水题，裸二分图最大匹配，每个问题和它的两个锦囊连边就行了

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <queue>
 
#define MAXE 1000
#define MAXN 1000
 
using namespace std;
 
struct edge
{
    int u,v,next;
}edges[MAXE];
 
char map[MAXN][MAXN]; 
 
int n,m,r,c;
int head[MAXN],nCount=0;
int linky[MAXN];
 
bool visit[MAXN];
 
bool inMap(int x,int y)
{
    if(x<1||x>n||y<1||y>m) return false;
    if(map[x][y]=='x') return false;
    return true;
}
 
int getNum(int x,int y)
{
    return (x-1)*m+y;
}
 
void AddEdge(int U,int V)
{
    edges[++nCount].u=U;
    edges[nCount].v=V;
    edges[nCount].next=head[U];
    head[U]=nCount;
}
 
bool dfs(int u)
{
    for(int p=head[u];p!=-1;p=edges[p].next)
    {
        int v=edges[p].v;
        if(visit[v]) continue;
        visit[v]=true;
        if(linky[v]==-1||dfs(linky[v]))
        {
            linky[v]=u;
            return true;
        } 
    }
    return false;
} 
 
int main()
{
    memset(head,-1,sizeof(head));
    scanf("%d%d%d%d",&n,&m,&r,&c);
    for(int i=1;i<=n;i++)
    {
        char in[MAXN];
        scanf("%s",in+1);
        for(int j=1;j<=m;j++)
            map[i][j]=in[j];
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            if(inMap(i-c,j-r)) AddEdge(getNum(i,j),getNum(i-c,j-r));
            if(inMap(i-c,j+r)) AddEdge(getNum(i,j),getNum(i-c,j+r));
            if(inMap(i+c,j-r)) AddEdge(getNum(i,j),getNum(i+c,j-r));
            if(inMap(i+c,j+r)) AddEdge(getNum(i,j),getNum(i+c,j+r));
        }
    memset(linky,-1,sizeof(linky));
    int ans=0,sum=0;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            if(map[i][j]=='.')
            {
                memset(visit,false,sizeof(visit));
                ans+=dfs(getNum(i,j));
                sum++;
            }
        }
    printf("%d\n",sum-ans);
    return 0;
}