在 n×nn×n 的棋盘上放 kk 个国王,国王可攻击相邻的 88 个格子,求使它们无法互相攻击的方案总数。
输入格式
共一行,包含两个整数 nn 和 kk。
输出格式
共一行,表示方案总数,若不能够放置则输出00。
数据范围
1≤n≤101≤n≤10,
0≤k≤n20≤k≤n2
输入样例:
3 2
输出样例:
16
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 12, M = 1 << 10, k = 110;
typedef long long LL;
LL f[N][k][M];
int cnt[M];
vector<int> state;
vector<int> head[M];
int n, m;
bool check(int x){
for (int i = 0; i < n; i ++)
if ((x >> i & 1) && (x >> i + 1 & 1))
return false;
return true;
}
int count(int x){
int res = 0;
for (int i = 0; i < n; i ++) res += x >> i & 1;
return res;
}
int main(){
cin >> n >> m;
for (int i = 0; i < 1 << n; i ++){
if (check(i)){
state.push_back(i);
cnt[i] = count(i);
}
}
for (int i = 0; i < state.size(); i ++)
for (int j = 0; j < state.size(); j ++){
int a = state[i], b = state[j];
if ((a & b) == 0 && check(a | b))
head[i].push_back(j);
}
f[0][0][0] = 1;
for (int i = 1; i <= n + 1; i ++)
for (int j = 0; j <= m; j ++)
for (int a = 0; a < state.size(); a ++)
for (int b : head[a]){
int c = cnt[state[a]];
if (j >= c){
f[i][j][a] += f[i - 1][j - c][b];
}
}
cout << f[n + 1][m][0] << endl;
return 0;
}