HDU 1045(二分图求最小点覆盖问题；dfs暴力)

题意：题目告诉你一张nxn的图，图上有的格子有东西挡着，问一个在图上最多放几个炮台能覆盖整张图，且不会火力部重叠。

建图方法：横竖分区。先看每一列，同一列相连的空地同时看成一个点，显然这样的区域不能够同时放两个点。这些点作为二分图的X部。同理在对所有的行用相同的方法缩点，作为Y部。
连边的条件是两个区域有相交部分。最后求最大匹配就是答案。

要注意的是，这里构图时最多能有16x16的

#include<stdio.h>
#include<string.h>
#define M 100
int map[M][M], c[M], y[M],A[M][M],B[M][M], nx, ny;
char str[M][M];

bool sp(int u) {
    for (int v = 0; v < ny; v++) {
        if (map[u][v] && !c[v]) {
            c[v] = 1;
            if (y[v] == -1 || sp(y[v])) {
                y[v] = u;
                return true;
            }
        }
    }
    return false;
}

int match() {
    int i, j, ans = 0;
    memset(y, -1, sizeof (y));
    for (i = 0; i < nx; i++) {
        for (j = 0; j < ny; j++)c[j] = 0;
        if (sp(i))ans++;
    }
    return ans;
}

int main() {
    int n, i, j, x, y,m;
    while (scanf("%d", &n),n) {
        for (i = 0; i < n; i++)
            scanf("%s", str[i]);
        nx = ny = 0;
        for(i=0;i<n;i++)
   for(j=0;j<n;j++)
    if(str[i][j]=='.'){
     if(j==0)A[i][j]=nx++;
     else if(str[i][j-1]=='.')A[i][j]=A[i][j-1];
     else A[i][j]=nx++;
     if(i==0)B[i][j]=ny++;
     else if(str[i-1][j]=='.')B[i][j]=B[i-1][j];
     else B[i][j]=ny++;
    }
         for(i=0;i<nx;i++)
          for(j=0;j<ny;j++)map[i][j]=0;
         for(i=0;i<n;i++)
    for(j=0;j<n;j++)
     if(str[i][j]=='.')map[A[i][j]][B[i][j]]=1;      
        printf("%d\n", match());
    }
    return 0;
}

暴力代码1：

#include <iostream>
using namespace std;

const int MAX = 5;

char map[MAX][MAX];
int n, maxNum;

void storeMap()
{
    for (int i = 0; i < n; ++i)
        cin >> map[i];
}

bool canPlace(int row, int col)
{
    int i;
    for (i = col - 1; i >= 0; --i)
    {
        if (map[row][i] == 'o') return false;
        if (map[row][i] == 'X') break;
    }
    for (i = row - 1; i >= 0; --i)
    {
        if (map[i][col] == 'o') return false;
        if (map[i][col] == 'X') break;
    }
    return true;
}

void dfs(int i, int num)
{    
    int row, col;
    if (i == n*n)
    {
        if (num > maxNum) maxNum = num;
        return;
    }
    else
    {
        row = i/n;
        col = i%n;
        if (map[row][col] == '.' && canPlace(row, col))
        {
            map[row][col] = 'o';
            dfs(i+1, num+1);
            map[row][col] = '.';
        }
        dfs(i+1, num);
    }
}

int main()
{
    while (cin >> n && n)
    {
        storeMap();
        maxNum = 0;
        dfs(0, 0);
        cout << maxNum << endl;
    }
    return 0;
}

暴力代码2:

#include <cstdio>
#include <cstring>

struct  A
{
    int x, y;
} E[20];
int total;
int map[6][6];
int n, ans;
int dir[4][2]
= { 1, 0, -1, 0, 0, 1, 0, -1 };

int judge2(int x, int y)
{
    if (x < 0 || x >= n || y < 0 || y >= n) return -1;
    return map[x][y];
}

int judge(int k)
{
    int flag, i, t_x, t_y, temp;
    flag = 0;
    for (i = 0; i < 4; ++i)
    {
        if (flag) break;
        t_x = E[k].x + dir[i][0];
        t_y = E[k].y + dir[i][1];
        while (t_x >= 0 && t_x < n && t_y >= 0 && t_y < n)
        {
            temp = judge2(t_x, t_y);
            if (temp == -1) break;
            if (temp == 1) { flag = 1; break; }
            t_x += dir[i][0];
            t_y += dir[i][1];
        }
    }
    return flag;
}

void DFS(int k, int num)
{
    if (num > ans) ans = num;
    if (k == total) return;
    DFS(k+1, num);
    if (!judge(k))
    {
        map[E[k].x][E[k].y] = 1;
        DFS(k+1, num+1);
        map[E[k].x][E[k].y] = 0;
    }
}

int main()
{
    int i, l;
    char str[10];
    while (scanf("%d", &n), n)
    {
        total = 0;
        for (i = 0; i < n; ++i)
        {
            scanf("%s", str);
            for (l = 0; str[l]; ++l)
            {
                if (str[l] == '.')
                {
                    map[i][l] = 0;
                    E[total].x = i;
                    E[total].y = l;
                    total++;
                }
                else if (str[l] == 'X')
                    map[i][l] = -1;
            }
        }
        ans = 0;
        DFS(0, 0);
        printf("%d\n", ans);
    }
}