Description
在N×N的棋盘里面放K个国王,使他们互不攻击,共有多少种摆放方案。国王能攻击到它上下左右,以及左上,左下,右上,右下八个方向上附近的各一个格子,共8个格子。
Input
只有一行,包含两个数N,K ( 1 <=N <=9, 0 <= K <= N * N)
Output
方案数。
Sample Input
3 2
Sample Output
16
思路: 先预处理出只关于一行合法的状态(即左右不相邻),最多87个。
- d p [ i ] [ j ] [ k ] dp[i][j][k] dp[i][j][k] 表示到第 i i i 行,状态为 j j j,国王摆放个数为 k k k 的方案数。
- 每一次枚举上一行 ( l a s t ) (last) (last) 与当前行 ( n o w ) (now) (now) 的状态,利用位运算判断左上,左下,右上,右下是否合法。
- 合法: d p [ i ] [ n o w ] [ n u m O n e O f _ n o w + x ] + = d p [ i − 1 ] [ l a s t ] [ x ] , 0 < = x < = m dp[i][now][numOneOf\_now + x] += dp[i - 1][last][x],0 <= x <= m dp[i][now][numOneOf_now+x]+=dp[i−1][last][x],0<=x<=m,其中 n u m O n e O f _ n o w numOneOf\_now numOneOf_now 是 n o w now now 状态 1 1 1 的个数, m m m 是总需要摆放的国王数
Code:
#include<bits/stdc++.h>
#define debug(x) cout << "[" << #x <<": " << (x) <<"]"<< endl
#define pii pair<int,int>
#define clr(a,b) memset((a),b,sizeof(a))
#define rep(i,a,b) for(int i = a;i < b;i ++)
#define pb push_back
#define MP make_pair
#define LL long long
#define ull unsigned LL
#define ls i << 1
#define rs (i << 1) + 1
#define fi first
#define se second
#define ptch putchar
#define CLR(a) while(!(a).empty()) a.pop()
using namespace std;
inline LL read() {
LL s = 0,w = 1;
char ch = getchar();
while(!isdigit(ch)) {
if(ch == '-') w = -1;
ch = getchar();
}
while(isdigit(ch))
s = s * 10 + ch - '0',ch = getchar();
return s * w;
}
inline void write(LL x) {
if(x < 0)
putchar('-'), x = -x;
if(x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
#ifndef ONLINE_JUDGE
clock_t prostart = clock();
#endif
const int maxn = 530;
LL dp[10][maxn][85];
vector<int>may;
int main() {
#ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
int n = read(),m = read();
for(int i = 0;i < (1 << n);++ i)
if(!(i & (i << 1))){
may.pb(i);
++ dp[1][i][__builtin_popcount(i)];
}
for(int i = 2;i <= n;++ i){
for(int j = 0;j < may.size();++ j){ /// i
for(int k = 0;k < may.size();++ k){ /// i - 1
if((may[j] & may[k]) || (may[j] & (may[k] >> 1)) || ((may[j] & may[k] << 1)))
continue;
int numOfj = __builtin_popcount(may[j]);
for(int ll = 0;ll <= m;++ ll)
dp[i][may[j]][numOfj + ll] += dp[i - 1][may[k]][ll];
}
}
}
LL ans = 0;
for(int i = 0;i < may.size();++ i)
ans += dp[n][may[i]][m];
cout << ans << endl;
#ifndef ONLINE_JUDGE
cout << "time: " << 1.0 * (clock() - prostart) / CLOCKS_PER_SEC << " s" << endl;
#endif
return 0;
}