BZOJ 状态压缩dp 1087: [SCOI2005]互不侵犯King

题目：http://www.lydsy.com/JudgeOnline/problem.php?id=1087

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string.h>
#include <queue>
#include <vector>
#include <algorithm>
#include <cassert>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
#define clr(a,x) memset(a,(x),sizeof(a));
#define eps 1e-8
#define LL long long
#define mp make_pair
const int maxn=1<<10;
int mask;
LL dp[2][maxn][85];
LL sum[85];
int N,K;

int p,q;
void SumUp(int cur,int s,int ss)
{
    if(cur>=N) {
        rep(i,0,K+1) sum[i] += dp[q][ss][i];
        return;
    }
    SumUp(cur+1,s,ss);
    if((s&(1<<cur))==0) SumUp(cur+1,s,ss|(1<<cur));
}

void dfs(int cur,int s,int cnt)
{
    if(cur>=N) {
        clr(sum,0);
        SumUp(0,(s|(s<<1)|(s>>1))&mask,0);
        rep(i,cnt,K+1) dp[p][s][i] += sum[i-cnt];
        return;
    }
    dfs(cur+1,s,cnt);
    s |= (1<<cur);
    dfs(cur+2,s,cnt+1);
}

void solve()
{
    mask=(1<<N)-1;
    clr(dp,0); dp[0][0][0]=1;
    p=1,q=0;
    rep(i,1,N+1) {
        clr(dp[p],0);
        dfs(0,0,0);
        p^=1; q^=1;
    }
    LL ans=0;
    rep(i,0,(1<<N)) ans += dp[p^1][i][K];
    printf("%lld\n",ans);
}

int main()
{
    while(scanf("%d%d",&N,&K)==2) {
        solve();
    }
}