E. The Child and Binary Tree（生成函数 + 多项式）

E. The Child and Binary Tree

不难写出一个递推式$f_n=\sum _{i=1}^n{g}_i\sum _{j=0}^{n-i}{f}_j{f}_{n-i-j}$，其中$g_i$表示$c$中有没有$i$这个数。

设$F(x)$为$f$的生成函数，$G(x)$为$g$的生成函数，则有$F(x)=G(x)F(x)F(x)+1$。

因为做卷积$[x^0]G$是为$0$的，所以会没有常数项，得在右边加$1$。

解这个方程有$F(x)=\frac{1\pm \sqrt{1-4G(x)}}{2G(x)}=\frac{2}{1\pm \sqrt{1-4G(x)}}$，取$x=0$时$\frac{1}{1\pm 1}$，所以负号不可取，$F(x)=\frac{2}{1+\sqrt{1-4G(x)}}$。

所以只要多项式开根，多项式求逆就可以得到答案了。

#include <bits/stdc++.h>

using namespace std;

const int mod = 998244353, inv2 = mod + 1 >> 1;

namespace Quadratic_residue {
  struct Complex {
    int r, i;

    Complex(int _r = 0, int _i = 0) : r(_r), i(_i) {}
  };

  int I2;

  Complex operator * (const Complex &a, Complex &b) {
    return Complex((1ll * a.r * b.r % mod  + 1ll * a.i * b.i % mod * I2 % mod) % mod, (1ll * a.r * b.i % mod + 1ll * a.i * b.r % mod) % mod);
  }

  Complex quick_pow(Complex a, int n) {
    Complex ans = Complex(1, 0);
    while (n) {
      if (n & 1) {
        ans = ans * a;
      }
      a = a * a;
      n >>= 1;
    }
    return ans;
  }

  int get_residue(int n) {
    mt19937 e(233);
    if (n == 0) {
      return 0;
    }
    if(quick_pow(n, (mod - 1) >> 1).r == mod - 1) {
      return -1;
    }
    uniform_int_distribution<int> r(0, mod - 1);
    int a = r(e);
    while(quick_pow((1ll * a * a % mod - n + mod) % mod, (mod - 1) >> 1).r == 1) {
      a = r(e);
    }
    I2 = (1ll * a * a % mod - n + mod) % mod;
    int x = quick_pow(Complex(a, 1), (mod + 1) >> 1).r, y = mod - x;
    if(x > y) swap(x, y);
    return x;
  }
}

const int N = 1e6 + 10;

int r[N], inv[N], b[N], c[N], d[N], e[N], t[N];

int quick_pow(int a, int n) {
  int ans = 1;
  while (n) {
    if (n & 1) {
      ans = 1ll * a * ans % mod;
    }
    a = 1ll * a * a % mod;
    n >>= 1;
  }
  return ans;
}

void get_r(int lim) {
  for (int i = 0; i < lim; i++) {
    r[i] = (i & 1) * (lim >> 1) + (r[i >> 1] >> 1);
  }
}

void get_inv(int n) {
  inv[1] = 1;
  for (int i = 2; i <= n; i++) {
    inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
  }
}

void NTT(int *f, int lim, int rev) {
  for (int i = 0; i < lim; i++) {
    if (i < r[i]) {
      swap(f[i], f[r[i]]);
    }
  }
  for (int mid = 1; mid < lim; mid <<= 1) {
    int wn = quick_pow(3, (mod - 1) / (mid << 1));
    for (int len = mid << 1, cur = 0; cur < lim; cur += len) {
      int w = 1;
      for (int k = 0; k < mid; k++, w = 1ll * w * wn % mod) {
        int x = f[cur + k], y = 1ll * w * f[cur + mid + k] % mod;
        f[cur + k] = (x + y) % mod, f[cur + mid + k] = (x - y + mod) % mod;
      }
    }
  }
  if (rev == -1) {
    int inv = quick_pow(lim, mod - 2);
    reverse(f + 1, f + lim);
    for (int i = 0; i < lim; i++) {
      f[i] = 1ll * f[i] * inv % mod;
    }
  }
}

void polyinv(int *f, int *g, int n) {
  if (n == 1) {
    g[0] = quick_pow(f[0], mod - 2);
    return ;
  }
  polyinv(f, g, n + 1 >> 1);
  for (int i = 0; i < n; i++) {
    t[i] = f[i];
  }
  int lim = 1;
  while (lim < 2 * n) {
    lim <<= 1;
  }
  get_r(lim);
  NTT(t, lim, 1);
  NTT(g, lim, 1);
  for (int i = 0; i < lim; i++) {
    int cur = (2 - 1ll * g[i] * t[i] % mod + mod) % mod;
    g[i] = 1ll * g[i] * cur % mod;
    t[i] = 0;
  }
  NTT(g, lim, -1);
  for (int i = n; i < lim; i++) {
    g[i] = 0;
  }
}

void polysqrt(int *f, int *g, int n) {
  if (n == 1) {
    g[0] = Quadratic_residue::get_residue(f[0]);
    return ;
  }
  polysqrt(f, g, n + 1 >> 1);
  polyinv(g, b, n);
  int lim = 1;
  while (lim < 2 * n) {
    lim <<= 1;
  }
  get_r(lim);
  for (int i = 0; i < n; i++) {
    t[i] = f[i];
  }
  NTT(g, lim, 1);
  NTT(b, lim, 1);
  NTT(t, lim, 1);
  for (int i = 0; i < lim; i++) {
    g[i] = (1ll * inv2 * g[i] % mod + 1ll * inv2 * b[i] % mod * t[i] % mod) % mod;
    b[i] = t[i] = 0;
  }
  NTT(g, lim, -1);
  for (int i = n; i < lim; i++) {
    g[i] = 0;
  }
}

void derivative(int *a, int *b, int n) {
  for (int i = 0; i < n; i++) {
    b[i] = 1ll * a[i + 1] * (i + 1) % mod;
  }
}

void integrate(int *a, int n) {
  for (int i = n - 1; i >= 1; i--) {
    a[i] = 1ll * a[i - 1] * inv[i] % mod;
  }
  a[0] = 0;
}

void polyln(int *f, int *g, int n) {
  polyinv(f, b, n);
  derivative(f, g, n);
  int lim = 1;
  while (lim < 2 * n) {
    lim <<= 1;
  }
  get_r(lim);
  NTT(g, lim, 1);
  NTT(b, lim, 1);
  for (int i = 0; i < lim; i++) {
    g[i] = 1ll * g[i] * b[i] % mod;
    b[i] = 0;
  }
  NTT(g, lim, -1);
  for (int i = n; i < lim; i++) {
    g[i] = 0;
  }
  integrate(g, n);
}

void polyexp(int *f, int *g, int n) {
  if (n == 1) {
    g[0] = 1;
    return ;
  }
  polyexp(f, g, n + 1 >> 1);
  int lim = 1;
  while (lim < 2 * n) {
    lim <<= 1;
  }
  polyln(g, d, n);
  for (int i = 0; i < n; i++) {
    t[i] = (f[i] - d[i] + mod) % mod;
  }
  t[0] = (t[0] + 1) % mod;
  get_r(lim);
  NTT(g, lim, 1);
  NTT(t, lim, 1);
  for (int i = 0; i < lim; i++) {
    g[i] = 1ll * g[i] * t[i] % mod;
    t[i] = d[i] =  0;
  }
  NTT(g, lim, -1);
  for (int i = n; i < lim; i++) {
    g[i] = 0;
  }
}

/*
  b存放多项式逆，
  c存放多项式开根，
  d存放多项式对数ln，
  e存放多项式指数exp，
  t作为中间转移数组,
  如果要用到polyinv，得提前调用get_inv(n)先预先得到我们想要得到的逆元范围。
*/

int a[N], n, m;

int main() {
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  // ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  scanf("%d %d", &n, &m);
  for (int i = 1, x; i <= n; i++) {
    scanf("%d", &x);
    a[x]++;
  }
  for (int i = 0; i <= 100000; i++) {
    a[i] = (mod - 4 * a[i]) % mod;
  }
  a[0] = 1;
  get_inv(200010);
  polysqrt(a, c, 200005);
  for (int i = 0; i < 200005; i++) {
    a[i] = c[i];
    c[i] = 0;
  }
  a[0] = (a[0] + 1) % mod;
  polyinv(a, b, 200005);
  for (int i = 1; i <= m; i++) {
    printf("%lld\n", 1ll * b[i] * 2 % mod);
  }
  return 0;
}