HDU4499Cannon

水题一道，小模拟，写的时候也算挺顺利，因为数据范围特别小所以直接暴力，用了一下剪枝不过不知道作用不大，无论如何还是ac了，不多说直接上代码

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdio>
#include <queue>
#include <map>
#include <algorithm>
#include <stack>
#include <utility>
typedef long long ll;
using namespace std;
int n,m,q;
int an,mx;
int a[6][6];
bool check(int i)
{
    int g,c;
    int j = i / n;
    i = i % n;
    c = 0;
    for(g = j - 1; g >= 0; g--)
    {
        if(!a[g][i])
            continue;
        if(c == 1&& a[g][i] == 2)
            return false;
        if(a[g][i])
            c++;
        if(c >= 2)
            break;
    }
    c = 0;
    for(g = i - 1; g >= 0; g--)
    {
        if(!a[j][g])
            continue;
        if(c == 1&& a[j][g] == 2)
            return false;
        if(a[j][g])
            c++;
        if(c >= 2)
            break;
    }
    return true;
}
void dfs(int i,int ans)
{
    ///printf("i = %d ans = %d\n",i,ans);
    while((a[i/n][i%n]||!check(i))&&i < mx)
        i++;
    if(ans + mx - i < an )
    {
        return;
    }
    if(i >= mx)
    {
        an = max(an,ans);
        return ;
    }
    a[i/n][i % n] = 2;
    dfs(i + 1,ans + 1);
    a[i/n][i % n] = 0;
    dfs(i + 1,ans);
    return;
}
int main ()
{
    int i,j,k,l;
    while (scanf("%d%d%d",&n,&m,&q) != EOF)
    {
        an = 0;
        mx = n * n;
        memset(a,0,sizeof(a));
        for(i = 0; i < q; i++)
        {
            scanf("%d%d",&k,&l);
            a[l][k] = 1;
        }
        dfs(0,0);
        printf("%d\n",an);
    }
}