P1896 基础状压DP

链接： https://www.luogu.org/problemnew/show/P1896

AC代码：

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll dp[12][(1<<9)+9][100];

int cnt(int x){
	int ans=0;
	for(int i=0;i<=9;i++){
		if((1<<i)&x){
			ans++;
		}
	}
	return ans;
}

bool judge(int x) {
	return ((x & (x>>1))==0 and (x & (x<<1))==0);
}

bool judge(int x, int y) {
	return (((x&y)==0) and ((x & (y>>1))==0) and ((x & (y<<1))==0));
}

int main() {
	int n,kk;
	cin>>n>>kk;
	memset(dp,0,sizeof(dp));
	
	dp[0][0][0]=1;

	for(int l=1;l<=n;l++){
		for(int i=0;i<=((1<<n)-1);i++){
			if(judge(i) and cnt(i)<=kk){ 
				for(int k=0;k<=((1<<n)-1);k++){//一定要遍历所有可能数量的国王 
					if(judge(k,i)){
						for(int num=0;num<=kk;num++){
							dp[l][i][cnt(i)+num]+=dp[l-1][k][num];	
						}										
					}
				}
			}
		}
	}

	ll ans=0;
	for(int i=0;i<=((1<<n)-1);i++){
		ans+=dp[n][i][kk];
	}
	cout<<ans<<endl;

}