Codeforces-1152F：Neko Rules the Catniverse（DP+矩阵快速幂）

最新推荐文章于 2022-11-05 15:51:00 发布

Mitsuha_

最新推荐文章于 2022-11-05 15:51:00 发布

阅读量348

点赞数 1

分类专栏： DP 数学-矩阵快速幂

本文链接：https://blog.csdn.net/Mitsuha_/article/details/89529448

版权

DP 同时被 2 个专栏收录

69 篇文章 3 订阅

订阅专栏

数学-矩阵快速幂

16 篇文章 0 订阅

订阅专栏

F2. Neko Rules the Catniverse (Large Version)
time limit per test 7 seconds
memory limit per test 256 megabytes
input standard input
output standard output
This problem is same as the previous one, but has larger constraints.

Aki is playing a new video game. In the video game, he will control Neko, the giant cat, to fly between planets in the Catniverse.

There are n planets in the Catniverse, numbered from 1 to n. At the beginning of the game, Aki chooses the planet where Neko is initially located. Then Aki performs k−1 moves, where in each move Neko is moved from the current planet x to some other planet y such that:
Planet $y$ is not visited yet.
$1 \leq y \leq x + m$ (where m is a fixed constant given in the input)

This way, Neko will visit exactly k different planets. Two ways of visiting planets are called different if there is some index i such that, the i-th planet visited in the first way is different from the i-th planet visited in the second way.

What is the total number of ways to visit k planets this way? Since the answer can be quite large, print it modulo $10^9+7$ .

Input
The only line contains three integers n, k and m $1≤n≤10^9, 1≤k≤min(n,12), 1≤m≤4)$ — the number of planets in the Catniverse, the number of planets Neko needs to visit and the said constant m.

Output
Print exactly one integer — the number of different ways Neko can visit exactly k planets. Since the answer can be quite large, print it modulo $10^9+7$ .

Examples
input
3 3 1
output
4
input
4 2 1
output
9
input
5 5 4
output
120
input
100 1 2
output
100

思路：假设现在已拜访的城市构成的序列方案是 $v_1,v_2,v_3.....,v_p.$

那么对于一个新的未拜访城市 $x$ 来说，我们考虑有多少方法可以将 $x$ 插入上面的序列构成新的方案数。

可以将 $x$ 插入上述序列中某个 $v_i$ 的后面，当且仅当 $x\le v_i+m$ ；如果 $x>=v_1$ ，则还可以将 $x$ 插入到 $v_1$ 前面。

于是我们可以从城市 $1$ 枚举到城市 $n$ ， $d [i] [j] [t p]$ 表示前 $i$ 个城市已经拜访了 $j$ 个城市，且从 $i$ 往前的 $m$ 个城市的访问状态为 $t p$ 的方案数。

$d [i] [j] [t p < < 1] + = d [i - 1] [j] [t p]$ （不拜访城市 $i$ ）
$d[i][j+1][(tp<<1)+1]+=(\_\_builtin\_popcount(tp)+1)*d[i-1][j][tp]$ （拜访城市 $i$ ，可以将 $i$ 插入 $v_1$ 之前以及满足条件的 $v_i$ 后）

找出转移方程后，就可以利用矩阵快速幂加速了。

#include<bits/stdc++.h>
using namespace std;
const int MAX=2e5+10;
const int MOD=1e9+7;
typedef long long ll;
struct lenka{int a[13*16][13*16];}res,a;
int len;
lenka cal(const lenka&A,const lenka&B)
{
    lenka C;
    memset(C.a,0,sizeof C.a);
    for(int i=0;i<len;i++)
    for(int j=0;j<len;j++)
    for(int k=0;k<len;k++)
    {
        C.a[i][j]+=1ll*A.a[i][k]*B.a[k][j]%MOD;
        C.a[i][j]%=MOD;
    }
    return C;
}
ll POW(int n)
{
    while(n)
    {
        if(n&1)res=cal(a,res);
        a=cal(a,a);
        n>>=1;
    }
    memset(a.a,0,sizeof a.a);
    a.a[0][0]=1;
    a=cal(a,res);
}
int main()
{
    int n,k,m;
    cin>>n>>k>>m;
    len=(k+1)*(1<<m);
    memset(a.a,0,sizeof a.a);
    memset(res.a,0,sizeof res.a);
    for(int i=0;i<len;i++)res.a[i][i]=1;
    for(int i=0;i<=k;i++)
    for(int j=0;j<(1<<m);j++)
    {
        int tp=(j<<1)%(1<<m);
        a.a[i*(1<<m)+j][i*(1<<m)+tp]=1;
        if(i<k)a.a[i*(1<<m)+j][(i+1)*(1<<m)+tp+1]=__builtin_popcount(j)+1;
    }
    POW(n);
    ll ans=0;
    for(int i=0;i<(1<<m);i++)(ans+=a.a[0][k*(1<<m)+i])%=MOD;
    cout<<ans<<endl;
    return 0;
}