bzoj3625 小朋友和二叉树

最新推荐文章于 2020-06-04 17:25:25 发布

wennitao

最新推荐文章于 2020-06-04 17:25:25 发布

阅读量158

点赞数

分类专栏：多项式算法文章标签：算法多项式

本文链接：https://blog.csdn.net/wennitao222/article/details/91358151

版权

算法同时被 2 个专栏收录

28 篇文章 0 订阅

订阅专栏

多项式

8 篇文章 0 订阅

订阅专栏

这篇博客介绍了如何解决bzoj3625题目，即在给定权值集合中求特定权值的二叉树数量问题。通过建立生成函数和多项式的关系，利用多项式运算找到解题方案，包括构造F(x)和C(x)，并通过多项式逆运算求解。

摘要由CSDN通过智能技术生成

题面：bzoj3625

题意：一棵带点权的树的权值为所有点的权值和。给定 $m$ ，求点权在给定集合中的权值为 $\le s \le m)$ 的二叉树的个数。

题解：设 $f (i)$ 为权值为 $i$ 的二叉树个数， $c (i)$ 为集合中数的生成函数。

$\sum _{i=1} ^n c(i) \sum _{j=0} ^i f(j) * f(n - i - j)$

$f (0) = 1$

构造生成函数 $\sum _{i=0} ^{\infty} f(i) x^i$ ， $\sum _{i=0} ^{\infty} c(i) x^i$

$F (x) = C (x) * F (x) * F (x) + 1$

解得 $\frac {1 \pm \sqrt{1-4C(x)}} {2C(x)}$

当取负号时多项式才可逆，上下再同乘共轭根式。

$\frac {1 - \sqrt {1 - 4C(x)}} {2C(x)} = \frac {1- (1 - 4C(x))} {2C(x)(1 + \sqrt {1 - 4C(x)})} = \frac {4C(x)} {2C(x)(1+\sqrt {1 - 4C(x)})} = \frac 2 {1 + \sqrt {1 - 4C(x)}}$

套多项式开根，求逆模板即可。

#include <bits/stdc++.h>
using namespace std;
inline int read() {
    int x = 0, f = 1; char c; c = getchar() ;
    while (c < '0' || c > '9') {if (c == '-') f = -1; c = getchar();}
    while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar() ;
    return x * f ;
}
typedef long long ll ;
const int maxn = 1e6 + 10 ;
int inv2 ;
namespace Polynomial {
    const int mod = 998244353, g = 3, ginv = 332748118 ;
    inline ll power (ll x, int y) {
        ll res = 1 ;
        while (y) {
            if (y & 1) res = res * x % mod ;
            x = x * x % mod; y >>= 1 ;
        }
        return res ;
    }
    inline void ntt (int a[], int n, int f) {
        for (int i = 0, j = 0; i < n; i ++) {
            if (i > j) swap (a[i], a[j]) ;
            for (int t = n >> 1; (j ^= t) < t; t >>= 1) ;
        }
        static int w[maxn] ;
        for (int i = 0; i <= n; i ++)
            w[i] = power (f ? ginv : g, (mod - 1) / n * i) ;
        for (int i = 2; i <= n; i <<= 1) {
            for (int j = 0; j < n; j += i)
                for (int k = 0; k < (i >> 1); k ++) {
                    int A = a[j + k], B = 1ll * w[n / i * k] * a[j + k + (i >> 1)] % mod ;
                    a[j + k] = (A + B) % mod; a[j + k + (i >> 1)] = (A - B + mod) % mod ;
                }
        }
        if (f) {
            int invn = power (n, mod - 2) ;
            for (int i = 0; i < n; i ++) a[i] = 1ll * a[i] * invn % mod ;
        }
    }
    int a[maxn], b[maxn], A[maxn], B[maxn] ;
    inline void inv (int a[], int b[], int len) {
        if (len == 1) {b[0] = power (a[0], mod - 2); return;}
        inv (a, b, len >> 1) ;
        for (int i = 0; i < len; i ++) A[i] = a[i], B[i] = b[i] ;
        ntt (A, len << 1, 0); ntt (B, len << 1, 0) ;
        for (int i = 0; i < (len << 1); i ++) A[i] = 1ll * A[i] * B[i] % mod * B[i] % mod ;
        ntt (A, len << 1, 1) ;
        for (int i = 0; i < len; i ++) b[i] = (2ll * b[i] % mod - A[i] + mod) % mod ;
        for (int i = 0; i < (len << 1); i ++) A[i] = B[i] = 0 ;
    }
    int C[maxn], D[maxn] ;
    inline void sqrt (int a[], int b[], int len) {
        if (len == 1) {b[0] = a[0]; return;}
        sqrt (a, b, len >> 1) ;
        for (int i = 0; i <= len; i ++) C[i] = a[i] ;
        inv (b, D, len) ;
        ntt (C, len << 1, 0); ntt (D, len << 1, 0) ;
        for (int i = 0; i < (len << 1); i ++) D[i] = 1ll * D[i] * C[i] % mod ;
        ntt (D, len << 1, 1) ;
        for (int i = 0; i < len; i ++) b[i] = 1ll * (D[i] + b[i]) % mod * inv2 % mod ;
        for (int i = 0; i <= (len << 1); i ++) C[i] = D[i] = 0 ;
    }
}
using namespace Polynomial ;
int n, m, c[maxn], d[maxn] ;
int main() {
    inv2 = power (2, mod - 2) ;
    n = read(); m = read() ;
    for (int i = 1; i <= n; i ++) ++ c[read()] ;
    int N ;
    for (N = 1; N <= m; N <<= 1) ;
    for (int i = 0; i < N; i ++) c[i] = (-4ll * c[i] + mod) % mod ;
    c[0] ++; sqrt (c, d, N) ;
    for (int i = 0; i < N; i ++) c[i] = 0 ;
    d[0] = (d[0] + 1) % mod; inv (d, c, N) ;
    for (int i = 1; i <= m; i ++) printf("%d\n", (int)(2ll * c[i] % mod)) ;
    return 0 ;
}