[CodeForces 156D] Clues（Prufer 序列 + 多项式定理） | 错题本

题目

[CodeForces 156D] Clues

分析

记联通块个数为 $k$，枚举每个联通块的度数 $d_i$（${\sum }_{i=1}^k{d}_i=2(k-1)$，每条边的贡献为 $2$，因此度数和为 $2(k-1)$），用重排列计算方案数，并且对于一个联通块，取里面一个点的方案数为联通块的大小 $s_i$，可得答案为 ∑ ∑ i = 1 k d i = 2 ( k − 1 ) ,   d i ≥ 1 ( ( ∑ i = 1 k ( d i − 1 ) ) ! ∏ i = 1 k ( ( d i − 1 ) ! ) ∏ i = 1 k s i d i ) = ∑ ∑ i = 1 k d i = 2 ( k − 1 ) ,   d i ≥ 1 ( ( k − 2 ) ! ∏ i = 1 k ( ( d i − 1 ) ! ) ∏ i = 1 k s i d i ) \begin{aligned} & \sum_{\sum_{i = 1}^{k} d_i = 2(k - 1),\ d_i \geq 1} \left( \frac{\left( \sum_{i = 1}^{k}(d_i - 1) \right) !}{\prod_{i = 1}^{k} ((d_i - 1)!)} \prod_{i = 1}^{k} {s_i}^{d_i} \right) \\ =& \sum_{\sum_{i = 1}^{k} d_i = 2(k - 1),\ d_i \geq 1} \left( \frac{(k - 2)!}{\prod_{i = 1}^{k} ((d_i - 1)!)} \prod_{i = 1}^{k} {s_i}^{d_i} \right) \end{aligned} =​∑i=1k​d