sgu225：Little Knights(状压DP+打表)

最新推荐文章于 2020-07-24 21:41:15 发布

Owaski

最新推荐文章于 2020-07-24 21:41:15 发布

阅读量501

点赞数

分类专栏： SGU

本文链接：https://blog.csdn.net/qq_20118433/article/details/45874411

版权

SGU 专栏收录该内容

191 篇文章 1 订阅

订阅专栏

题目大意：
$~~~~~~$ 给定一个 $n*n$ 的棋盘，放 $k$ 个马，使其互不攻击的方案数。 $n\leq 10, k\leq n^2$ 。

分析：
$~~~~~~$ 状压 $DP$ 啊，预处理一下合法状态就好了，但是 $n=10$ 要打表是什么心态…(表是贴的翱犇的…)

AC code：

#include <cstdio>
#include <iostream>
#define get(s, i) ((s>>(i-1))&1)
typedef long long LL;
#define ONLINE_JUDGE

const int MAXN = 10;
int n, m;
int sum[1<<MAXN];
int sta[30000], tot;
int L[1<<MAXN], R[1<<MAXN];
int cmp[1<<MAXN][1<<MAXN];
LL f[2][30000][101];
LL ans;
char table[101][20]={"1","100","4662","135040","2732909","41199404","481719518",
"4491423916","34075586550","213628255072","1120204619108","4961681221524",
"18715619717199","60541371615660","168976761361446","409191804533576",
"864172675710439","1599730843649564","2609262108838924","3770687313420780",
"4857550050070531","5616928666465104","5874943705896600","5604501518609804",
"4917655076255841","3999855946779732","3034690618677388","2156485957257040",
"1437827591264317","899278231344296","526753407546620","288274613750624",
"146990556682887","69626509814580","30542906352994","12366448408056",
"4604442057431","1569983914256","487876545370","137395261280","34831261750",
"7884855000","1578162590","275861904","41455966","5246412","543534","44244",
"2652","104","2","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0",
"0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0",
"0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0"};

bool check(int p, int q)
{
    for(int i = 1; i <= n; ++i)
        if(get(q, i))
        {
            if(i > 2 && get(p, i-2)) return false;
            if(i < n-1 && get(p, i+2)) return false;
        }
    return true;
}

bool check2(int p, int q)
{
    for(int i = 1; i <= n; ++i)
        if(get(q, i))
        {
            if(i > 1 && get(p, i-1)) return false;
            if(i < n && get(p, i+1)) return false;
        }
    return true;    
}

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("sgu225.in", "r", stdin);
    freopen("sgu225.out", "w", stdout);
    #endif

    std::ios::sync_with_stdio(0);
    std::cin >> n >> m;
    if(n == 10)
    {
        std::cout << table[m] << std::endl;
        return 0;
    }
    for(int i = 0; i < (1<<n); ++i)
    {
        int ti = i;
        while(ti)
        {
            sum[i] += ti&1;
            ti >>= 1;   
        }
    }
    for(int i = 0; i < (1<<n); ++i)
    {
        L[i] = tot+1;
        for(int j = 0; j < (1<<n); ++j)
        {
            if(check(i, j)) 
            {
                sta[++tot] = i|(j<<n);
                if(!i) f[0][tot][sum[j]] = 1;
            }
            if(check2(i, j))
                cmp[i][j] = 1;
        }
        R[i] = tot;
    }
    for(int i = 1; i < n; ++i)
    {
        int now = i&1, last = now^1;
        for(int j = 1; j <= tot; ++j)
        {
            int pre = sta[j]&((1<<n)-1);
            int las = sta[j]>>n; 
            for(int k = L[las]; k <= R[las]; ++k)
                if(cmp[pre][sta[k]>>n])
                    for(int p = 0; p+sum[sta[k]>>n] <= m; ++p)
                        f[now][k][p+sum[sta[k]>>n]] += f[last][j][p];
            for(int p = 0; p <= m; ++p)
                f[last][j][p] = 0;
        }
    }
    for(int i = 1; i <= tot; ++i)
        ans += f[(n&1)^1][i][m];
    std::cout << ans << std::endl;


    #ifndef ONLINE_JUDGE
    fclose(stdin);
    fclose(stdout);
    #endif
    return 0;
}