HDU4499

In Chinese Chess, there is one kind of powerful chessmen called Cannon. It can move horizontally or vertically along the chess grid. At each move, it can either simply move to another empty cell in the same line without any other chessman along the route or perform an eat action. The eat action, however, is the main concern in this problem. 
An eat action, for example, Cannon A eating chessman B, requires two conditions: 
1、A and B is in either the same row or the same column in the chess grid. 
2、There is exactly one chessman between A and B. 
Here comes the problem. 
Given an N x M chess grid, with some existing chessmen on it, you need put maximum cannon pieces into the grid, satisfying that any two cannons are not able to eat each other. It is worth nothing that we only account the cannon pieces you put in the grid, and no two pieces shares the same cell.

 

Input

There are multiple test cases. 
In each test case, there are three positive integers N, M and Q (1<= N, M<=5, 0<=Q <= N x M) in the first line, indicating the row number, column number of the grid, and the number of the existing chessmen. 
In the second line, there are Q pairs of integers. Each pair of integers X, Y indicates the row index and the column index of the piece. Row indexes are numbered from 0 to N-1, and column indexes are numbered from 0 to M-1. It guarantees no pieces share the same cell.

 

Output

There is only one line for each test case, containing the maximum number of cannons.

 

Sample Input

4 4 2

1 1 1 2

5 5 8

0 0 1 0 1 1 2 0 2 3 3 1 3 2 4 0

 

Sample Output

8

9

--------------------------------暴力--------------看不懂过程就输出我注释掉的再观察一下

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;

typedef long long LL;
const int MAXN = ;
const int INF = 0x3f3f3f3f;

int n, m, dis[][] = {, , , , , -, -, };
int vis[MAXN][MAXN], ans = ;

bool check(int x, int y)
{
    int i, j, k;
    int flag;
    for(k = ;k < ;++k)
    {
        flag = ;
        i = x + dis[k][];
        j = y + dis[k][];
        while(i >=  && j >=  && i < n && j < m)
        {
            if(flag && vis[i][j] == )
                return false;
            else if(flag && vis[i][j] == -)
                break;
            if(vis[i][j] && !flag)
                flag++;
            i += dis[k][];
            j += dis[k][];
        }
    }
    return true;
}

void dfs(int x, int y, int cnt)
{
    if(x >= n)
    {
        ans = max(ans, cnt);
//        cout << endl;
//        for(int i = 0;i < n;++i)
//        {
//            for(int j = 0;j < m;++j)
//                cout << vis[i][j] << " ";
//            cout << endl;
//        }
        return ;
    }
    if(y != m - )
    {
        dfs(x, y + , cnt);
        if(vis[x][y] != - && check(x, y))
        {
            vis[x][y] = ;
            dfs(x, y + , cnt + );
            vis[x][y] = ;
        }
    }
    else
    {
        dfs(x + , , cnt);
        if(vis[x][y] != - && check(x, y))
        {
            vis[x][y] = ;
            dfs(x + , , cnt + );
            vis[x][y] = ;
        }
    }
}

int main()
{
    int q;
    while(scanf("%d%d%d", &n, &m, &q) != EOF)
    {
        memset(vis, , sizeof(vis));
        ans = ;
        int x, y;
        while(q--)
        {
            scanf("%d%d", &x, &y);
            vis[x][y] = -;
        }
        dfs(, , );
        printf("%d\n", ans);
    }
    return ;
}