【六省联考2017】【BZOJ4870】【LOJ2143】组合数问题

【题目链接】

• BZOJ4870
• LOJ2143

【前置技能】

• 简单的组合数知识
• DP
• 矩阵乘法

【题解】

• 将原问题转化一下，即求$\displaystyle\sum_{i\%k=r}^{ } C_{nk}^i$
• $C_n^m=C_{n-1}^{m-1}+C_{n-1}^m$，那么求和也一样满足,那么在$m$对$k$取模的意义下依然满足。
• 我们设状态$F[n][m]=\displaystyle\sum_{m\%k=r}^{ } C_{n}^m$，那么这样转移方程就直接由组合数的公式推得$F[n][m]=F[n-1][(m-1+k)\%k]+F[n-1][m]$
• 初始值$F[1][0]=F[1][1]=1$。
• 既然DP方程都已经出来了，矩乘优化一下就好了。
• 时间复杂度$O(K^3*log(N*K))$。

【代码】

#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define LL  long long
#define MAXLOG  40
#define MAXN    80
using namespace std;
int n, k, r;
LL mat[MAXLOG + 2][MAXN][MAXN], f[MAXN][3];
LL tim, mod;

template <typename T> void chkmin(T &x, T y){x = min(x, y);}
template <typename T> void chkmax(T &x, T y){x = max(x, y);}
template <typename T> void read(T &x){
    x = 0; int f = 1; char ch = getchar();
    while (!isdigit(ch)) {if (ch == '-') f = -1; ch = getchar();}
    while (isdigit(ch)) {x = x * 10 + ch - '0'; ch = getchar();}
    x *= f;
}

LL qpow(LL a, int b){
   LL ret = 1;
        while (b){
        if (b & 1) ret = ret * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ret;
}

int main(){
    read(n), read(mod), read(k), read(r);
    if (k == 1) {
        printf("%lld\n", qpow(2, n));
        return 0;
   }
    if (k == 2) {
        printf("%lld\n", qpow(2, 2 * n - 1));
        return 0;
    }
    tim = 1ll * n * k - 1;
    mat[0][1][k] = 1;
    for (int i = 1; i <= k; ++i)
        mat[0][i][i] = mat[0][i][i - 1] = 1;
    for (int p = 1; p <= MAXLOG; ++p)
        for (int i = 1; i <= k; ++i)
            for (int j = 1; j <= k; ++j)
                for (int t = 1; t <= k; ++t)
                    mat[p][i][j] = (1ll * mat[p][i][j] + 1ll * mat[p - 1][i][t] * mat[p - 1][t][j] % mod) % mod;
    f[1][1] = f[2][1] = 1;
    for (int p = 0; p <= MAXLOG; ++p)
        if (tim & (1ll << p)) {
            LL tmp[MAXN][3];
            memset(tmp, 0, sizeof(tmp));
            for (int i = 1; i <= k; ++i)
                for (int j = 1; j <= 1; ++j)
                    for (int t = 1; t <= k; ++t)
                        tmp[i][j] = (1ll * tmp[i][j] + 1ll * mat[p][i][t] * f[t][j] % mod) % mod;
            for (int i = 1; i <= k; ++i)
                for (int j = 1; j <= 1; ++j)
                    f[i][j] = tmp[i][j];
        }
    printf("%lld\n", f[r + 1][1]);
    return 0;
}