CodeChef BINOMSUM

链接：

link

题意：

有$T$天，每天有$K$个小时，第$i$天有$D+i-1$道菜，第一个小时你选择$L$道菜吃，接下来每个小时你可以选择吃一道菜或者选择$A$个活动中的一个参加，不能连续两个小时吃菜，问每天的方案数之和。$K, A$预先给定，$Q$次询问，每次给$D, L, T$。

题解：

将$ans = \sum_{i=D}^{D+T-1} \binom{i}{L} F(i)$，显然$F$是一个多项式，次数不超过$K/2$，之后为了方便，我们认为它是$K$次多项式。

令$F(x) = \sum_{i=0}^{K-1} a_i(x+1)(x+2)...(x+i)$，将原来式子展开，有

$ans=\frac{\sum_{i=0}^{K-1} a_i \sum_{j=D}^{D+T-1} \frac{(j+i)!}{(j-L)!}}{L!}$

$\sum_{j=D}^{D+T-1} \frac{(j+i)!}{(j-L)!} = (i+L)! \sum_{j=D}^{D+T-1} \binom{j+i}{i+L}$，可以$O(1)$计算。

考虑求$a_i$，不妨求出$F$在$-1, -2, ...-K$处的点值，有

$F(-n) = \sum_{i=0}^{n-1} a_i \frac{(-n)!}{(i-n)!}$，移项得

$\frac{F(-n)}{(-n)!} = \sum_{i=0}^{n-1} \frac{a_i}{(i-n)!}$

用生成函数推一下$A = F - A * B$，其中$b_i = \frac{1}{(-i)!}$，$b_0=0$，$A = \frac{F}{B+1}$，多项式求逆即可。

代码：

#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;

typedef long long LL;
typedef pair <int, int> pii;

inline int Read()
{
    int x = 0, f = 1, c = getchar();
    for (; !isdigit(c); c = getchar())
        if (c == '-')
            f = -1;
    for (;  isdigit(c); c = getchar())
        x = x * 10 + c - '0';
    return x * f;
}

const int MAXN = 262145;
const int MAXM = 10100005;

int n, a, k, q, mod, f[MAXN], g[MAXN], h[MAXN], fac[MAXM], inv[MAXM];

struct Matrix
{
    int a[2][2];

    Matrix()
    {
        a[0][0] = a[0][1] = a[1][0] = a[1][1] = 0;
    }

    Matrix operator * (const Matrix &b) const
    {
        Matrix c;
        for (int k = 0; k < 2; k ++)
            for (int i = 0; i < 2; i ++)
                for (int j = 0; j < 2; j ++)
                    c.a[i][j] = (1LL * a[i][k] * b.a[k][j] + c.a[i][j]) % mod;
        return c;
    }
};

inline int C(int x, int y)
{
    if (x < y)
        return 0;
    return 1LL * fac[x] * inv[y] % mod * inv[x - y] % mod;
}

inline int Qow(int x, int y)
{
    int r = 1;
    for (; y; y >>= 1, x = 1LL * x * x % mod)
        if (y & 1)
            r = 1LL * r * x % mod;
    return r;
}

inline int Solve(int x)
{
    Matrix r, c;
    r.a[0][0] = 1, c.a[0][0] = a % mod, c.a[0][1] = 1, c.a[1][0] = 1LL * a * x % mod;
    for (int i = k; i; i >>= 1, c = c * c)
        if (i & 1)
            r = r * c;
    return r.a[0][0];
}

inline void Mul(int *a, int *b, int *c, int n)
{
    static LL d[16];
    if (n <= 8)
    {
        for (int i = 0; i < n << 1; i ++)
            d[i] = 0;
        for (int i = 0; i < n; i ++)
            for (int j = 0; j < n; j ++)
                d[i + j] += 1LL * a[i] * b[j];
        for (int i = 0; i < n << 1; i ++)
            c[i] = d[i] % mod;
        return ;
    }
    int m = n >> 1, x[m], y[m], z[n];
    Mul(a, b, c, m), Mul(a + m, b + m, c + n, m);
    for (int i = 0; i < m; i ++)
        x[i] = (a[i] + a[i + m]) % mod, y[i] = (b[i] + b[i + m]) % mod;
    Mul(x, y, z, m);
    for (int i = 0; i < n; i ++)
        z[i] = (0LL + z[i] - c[i] - c[i + n] + mod + mod) % mod;
    for (int i = 0; i < n; i ++)
        c[i + m] = (c[i + m] + z[i]) % mod;
}

inline void Inv(int *a, int *b, int n)
{
    static int c[MAXN], d[MAXN];
    if (n == 1)
        return (void)(b[0] = Qow(a[0], mod - 2));
    Inv(a, b, n + 1 >> 1);
    Mul(a, b, c, n);
    for (int i = n; i < n << 1; i ++)
        c[i] = 0;
    for (int i = 0; i < n; i ++)
        c[i] = (mod - c[i]) % mod;
    c[0] = (c[0] + 2) % mod;
    Mul(b, c, d, n);
    for (int i = 0; i < n; i ++)
        b[i] = d[i];
}

int main()
{
#ifdef wxh010910
    freopen("data.in", "r", stdin);
#endif
    k = Read() - 1, a = Read(), mod = Read(), q = Read(), fac[0] = fac[1] = inv[0] = inv[1] = 1;
    int N = 1e7 + k;
    for (int i = 2; i <= N; i ++)
        fac[i] = 1LL * fac[i - 1] * i % mod, inv[i] = 1LL * (mod - mod / i) * inv[mod % i] % mod;
    for (int i = 2; i <= N; i ++)
        inv[i] = 1LL * inv[i - 1] * inv[i] % mod;
    for (n = 1; n << 1 <= k; n <<= 1);
    for (int i = 0; i < n; i ++)
    {
        f[i] = 1LL * inv[i] * Solve(mod - i - 1) % mod;
        if (i & 1)
            f[i] = (mod - f[i]) % mod;
    }
    for (int i = 0; i < n; i ++)
        if (i & 1)
            g[i] = mod - inv[i];
        else
            g[i] = inv[i];
    Inv(g, h, n), Mul(f, h, g, n);
    while (q --)
    {
        int l = Read(), d = Read(), t = Read(), ret = 0;
        for (int i = 0; i < n; i ++)
            ret = (1LL * (C(d + i + t, l + i + 1) - C(d + i, l + i + 1) + mod) * fac[i + l] % mod * g[i] + ret) % mod;
        printf("%d\n", 1LL * ret * inv[l] % mod);
    }
    return 0;
}