洛谷P4389 付公主的背包——生成函数+多项式

题目链接戳这里

题目描述

有(n)件不同的商品，每件物品都有无限个，输出总体积为([1,m])的方案数

思路

直接跑背包有(30)
考虑把每个物品的生成函数设出来，对于一件体积为(v)的物品：

[f(x)=1+x^v+x^{2v}+cdots +x^{kv}+cdots ]

那么答案(F(x))就是每个物品的(f)卷起来：

[F(x)=prodlimits_{i=1}^{n}f_i(x)=prodlimits_{i=1}^{n}frac{1}{1-x^{v_i}} ]

直接做是(O(mnlog n))的
因为乘法比较麻烦，考虑将其转化为加法，在两边分别取(ln)可得：

[ln F(x)=sumlimits_{i=1}^{n}ln f_i(x) ]

又观察到对(f(x))作如下变化后的形式很特殊，即：

[ln f(x)=int (ln f(x))'=int frac{f'(x)}{f(x)}=int (1-x^v)f'(x)=int (1-x^v)sumlimits_{i=1}ivx^{iv-1}=int sumlimits_{i=1}ivx^{iv-1}-sumlimits_{i=2}(i-1)vx^{iv-1}=int sumlimits_{i=1}vx^{iv-1}=sumlimits_{i=1}i^{-1}x^{iv} ]

竟然是个调和级数的形式，太神奇了！于是(O(nln n))地统计一下再做个(exp)就行了

#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

#define N 100000
#define MOD 998244353

int n, m, v[N+5], cnt[N+5];
int f[4 * N + 5], g[4 * N + 5], f1[4 * N + 5], g1[4 * N + 5], h[4 * N + 5];

int fpow(int x, int p)
{
  int ret = 1;
  while (p)
  {
    if (p & 1)
      ret = 1LL * ret * x % MOD;
    x = 1LL * x * x % MOD;
    p >>= 1;
  }
  return ret;
}

void bitReverse(int *s, int len, int bit)
{
  for (int i = 0; i < len; ++i)
  {
    int t = 0;
    for (int j = 0; j < bit; ++j)
      if ((i >> j) & 1)
        t |= 1 << (bit - 1 - j);
    if (i < t)
      swap(s[i], s[t]);
  }
}

void DFT(int *s, int flag, int len, int bit)
{
  bitReverse(s, len, bit);
  for (int l = 2; l <= len; l <<= 1)
  {
    int mid = l >> 1, t = fpow(3, (MOD - 1) / l);
    if (flag)
      t = fpow(t, MOD - 2);
    for (int *p = s; p != s + len; p += l)
    {
      int w = 1;
      for (int i = 0; i < mid; ++i)
      {
        int x = p[i], y = 1LL * w * p[i + mid] % MOD;
        p[i] = (x + y) % MOD, p[i + mid] = (x - y) % MOD;
        w = 1LL * w * t % MOD;
      }
    }
  }
  if (flag)
  {
    int inv = fpow(len, MOD - 2);
    for (int i = 0; i < len; ++i)
      s[i] = 1LL * s[i] * inv % MOD;
  }
}

void polyInv(int *f, int *g, int c)
{
  if (c == 0)
  {
    g[0] = fpow(f[0], MOD - 2);
    return;
  }
  int len = 1 << c;
  polyInv(f, g, c - 1);
  for (int i = 0; i < len; ++i)
    f1[i] = f[i];
  DFT(f1, 0, len << 1, c + 1), DFT(g, 0, len << 1, c + 1);
  for (int i = 0; i < (len << 1); ++i)
    g[i] = g[i] * (2 - 1LL * f1[i] * g[i] % MOD) % MOD;
  DFT(g, 1, len << 1, c + 1);
  for (int i = len; i < (len << 1); ++i)
    g[i] = 0;
}

void d(int *f, int *g, int c)
{
  g[c - 1] = 0;
  for (int i = 0; i < c - 1; ++i)
    g[i] = 1LL * f[i + 1] * (i + 1) % MOD;
}

void d_(int *f, int *g, int c)
{
  g[0] = 0;
  for (int i = 1; i < c; ++i)
    g[i] = 1LL * f[i - 1] * fpow(i, MOD - 2) % MOD;
}

void polyLn(int *f, int *g, int c)
{
  int len = 1 << c;
  polyInv(f, g, c);
  d(f, g1, len);
  DFT(g, 0, len << 1, c + 1), DFT(g1, 0, len << 1, c + 1);
  for (int i = 0; i < (len << 1); ++i)
    g1[i] = 1LL * g[i] * g1[i] % MOD;
  DFT(g1, 1, len << 1, c + 1);
  d_(g1, g, len);
  for (int i = 0; i < (len << 1); ++i)
    f1[i] = g1[i] = 0;
  for (int i = len; i < (len << 1); ++i)
    g[i] = 0;
}

void polyExp(int *f, int *g, int c)
{
  if (c == 0)
  {
    g[0] = 1;
    return;
  }
  int len = 1 << c;
  polyExp(f, g, c - 1);
  polyLn(g, h, c);
  h[0] = (1 - h[0] + f[0]) % MOD;
  for (int i = 1; i < len; ++i)
    h[i] = (f[i] - h[i]) % MOD;
  DFT(g, 0, len << 1, c + 1), DFT(h, 0, len << 1, c + 1);
  for (int i = 0; i < (len << 1); ++i)
    g[i] = 1LL * g[i] * h[i] % MOD, h[i] = 0;
  DFT(g, 1, len << 1, c + 1);
  for (int i = len; i < (len << 1); ++i)
    g[i] = 0;
}

int main()
{
  scanf("%d%d", &n, &m);
  int bit = 0;
  while((1<<bit) < m+1) bit++;
  for(int i = 1; i <= n; ++i) {
    scanf("%d", &v[i]);
    cnt[v[i]]++;
  }
  for(int i = 1; i <= m; ++i) {
    if(!cnt[i]) continue;
    for(int j = 1; j*i <= m; ++j)
      f[i*j] = (f[i*j]+1LL*cnt[i]*fpow(j, MOD-2))%MOD;
  }
  polyExp(f, g, bit);
  for(int i = 1; i <= m; ++i) printf("%d
", (g[i]+MOD)%MOD);
  return 0;
}