[UVALive 6696] A Generalized N-Queens Problem

题意： 在一个n*n的棋盘上， 有一些黑色的障碍物， 问最多能摆多少个皇后， 使其两两不能互相攻击。 两个皇后能互相攻击的条件是处在同一行或同一列或同一条左斜或右斜线上， 且之间没有障碍物。（$n \leq 10$）

思路： 枚举每对位置， 将不会互相攻击的位置连边， 问题转换为一个最大团问题。 点数小于100个的图求最大团是可以直接搜索的。

#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>

#define ll long long
#define id(i, j) (((i) - 1) * n + (j))

using namespace std;

const int N = 30;

int n, tot, G[N][N], g[N * N][N * N], pre[N][N][4];

int ans, num[N * N];
bool dfs(int *adj, int total, int cnt){
    int t[N * N];
    if (total == 0){
        if (ans < cnt) {ans = cnt; return 1;}
        return 0;
    }

    for (int i = 1; i <= total; i ++){
        if (cnt + (total - i + 1) <= ans) return 0;
        if (cnt + num[adj[i]] <= ans) return 0;

        int sz = 0;
        for (int j = i + 1; j <= total; j ++)
            if (g[adj[i]][adj[j]]) t[++ sz] = adj[j];

        if (dfs(t, sz, cnt + 1)) return 1;
    }

    return 0;
}

void max_clique(){

    int adj[N * N]; ans = 0;
    for (int i = n * n; i >= 1; i --){
        int sz = 0;
        for (int j = i + 1; j <= n * n; j ++)
            if (g[i][j]) adj[++ sz] = j;

        dfs(adj, sz, 1);

        num[i] = ans;
    }

}

int main(){

    int T;
    for (scanf("%d", &T); T --; ){
        scanf("%d", &n);

        tot = 0;  
        memset(G, 0, sizeof(G));
        memset(g, 0, sizeof(g));
        memset(pre, 0, sizeof(pre));

        for (int i = 1; i <= n; i ++)
            for (int j = 1; j <= n; j ++){
                int x; scanf("%d", &x);
                if (x) G[i][j] = ++  tot;
            }


        for (int i = 0; i <= n + 1; i ++){
            G[i][0] = ++  tot; G[0][i] = ++  tot;
            G[n + 1][i] = ++  tot; G[i][n + 1] = ++  tot;
        }

        for (int a = 1; a <= n; a ++)
            for (int b = 1; b <= n; b ++){
                if (G[a][b] != 0) continue;

                int i;
                for (i = a - 1; G[i][b] == 0; i --); pre[a][b][0] = G[i][b];
                for (i = b - 1; G[a][i] == 0; i --); pre[a][b][1] = G[a][i];
                for (i = 1; G[a - i][b - i] == 0; i ++); pre[a][b][2] = G[a - i][b - i];
                for (i = 1; G[a - i][b + i] == 0; i ++); pre[a][b][3] = G[a - i][b + i];

            }

        for (int a = 1; a <= n; a ++)
            for (int b = 1; b <= n; b ++)
                for (int _a = 1; _a <= n; _a ++)
                    for (int _b = 1; _b <= n; _b ++){
                        bool ok = G[a][b] == 0 && G[_a][_b] == 0;
                        for (int k = 0; k < 4 && ok; k ++)
                            if (pre[a][b][k] == pre[_a][_b][k]) ok = 0;
                        if (ok) g[id(a, b)][id(_a, _b)] = 1;
                    }


        max_clique();

        printf("%d\n", ans);
    }

    return 0;
}