P3978 [TJOI2015]概率论

P3978 [TJOI2015]概率论

题目描述

Solution

设$C_n$表示$n$个节点的树的个数（卡特兰数），$S_n$表示$n$个节点的所有树的叶子的个数和。
$$\begin{gathered} C_n=\sum _{i=0}^{n-1}{C}_i{C}_{n-i-1}+[n==0] \\ {S}_n=2\sum _{i=0}^{n-1}{S}_i{C}_{n-i-1}+[n==1] \end{gathered}$$
写出$C_n$和$S_n$的生成函数：
$$\begin{gathered} C(z)=z\sum _{n,i}{C}_i{z}^i{C}_{n-i-1}{z}^{n-i-1} \\ S(z)=2z\sum _{n,i}{S}_i{z}^i{C}_{n-i-1}{z}^{n-i-1}+z \end{gathered}$$
因此：

$$\begin{gathered} C(z)=zC(z)C(z)+1 \\ S(z)=2zS(z)C(z)+z \end{gathered}$$

将$C(z)$当做一个未知数，解出一元二次方程的解$C(z)$：
$$C(z)=\frac{1-\sqrt{1-4z}}{2z}$$

继续推出$S(z)$的表达式：
$$\begin{gathered} (1-2zC(z))S(z)=z \\ S(z)=\frac{z}{1-2zC(z)} \\ S(z)=\frac{z}{1-2z\frac{1-\sqrt{1-4z}}{2z}} \\ S(z)=\frac{z}{\sqrt{1-4z}} \end{gathered}$$
因此我们想要知道的就是$[z^n]S(z)$，也就是$S(z)$在$z^n$的系数。
有：
$$\begin{gathered} S(z)=z(1-4z{)}^{-\frac{1}{2}} \\ S(z)=z\sum _{n>=0}(\genfrac{}{}{0ex}{}{-\frac{1}{2}}{n})(-4z{)}^n \\ S(z)=\sum _{n>=1}\left(\genfrac{}{}{0ex}{}{-\frac{1}{2}}{n-1}\right)(-4{)}^{n-1}{z}^n \end{gathered}$$
其中
$$\sum _{n>=0}\left(\genfrac{}{}{0ex}{}{-\frac{1}{2}}{n}\right)(-4{)}^n=(\genfrac{}{}{0ex}{}{2n}{n})$$

因此
$$S(z)=\left(\genfrac{}{}{0ex}{}{2n-2}{n-1}\right)z^n$$
$$[z^n]S(z)=\left(\genfrac{}{}{0ex}{}{2n-2}{n-1}\right)$$
答案就是
$$Ans=\frac{\left(\genfrac{}{}{0ex}{}{2n-2}{n-1}\right)}{C_n}=\frac{\left(\genfrac{}{}{0ex}{}{2n-2}{n-1}\right)(n+1)}{\left(\genfrac{}{}{0ex}{}{2n}{n}\right)}=\frac{n(n+1)}{2(2n-1)}$$

时间复杂度$O(你想咋地就咋地)$，可能会有点卡精度。

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <cassert>
#include <string.h>
//#include <unordered_set>
//#include <unordered_map>
//#include <bits/stdc++.h>

#define MP(A,B) make_pair(A,B)
#define PB(A) push_back(A)
#define SIZE(A) ((int)A.size())
#define LEN(A) ((int)A.length())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define fi first
#define se second

using namespace std;

template<typename T>inline bool upmin(T &x,T y) { return y<x?x=y,1:0; }
template<typename T>inline bool upmax(T &x,T y) { return x<y?x=y,1:0; }

typedef long long ll;
typedef unsigned long long ull;
typedef long double lod;
typedef pair<int,int> PR;
typedef vector<int> VI;

const lod eps=1e-11;
const lod pi=acos(-1);
const int oo=1<<30;
const ll loo=1ll<<62;
const int mods=10007;
const int inv6=(mods+1)/6;
const int MAXN=600005;
const int INF=0x3f3f3f3f;//1061109567
/*--------------------------------------------------------------------*/
inline int read()
{
	int f=1,x=0; char c=getchar();
	while (c<'0'||c>'9') { if (c=='-') f=-1; c=getchar(); }
	while (c>='0'&&c<='9') { x=((x<<3)+(x<<1)+(c^48))%mods; c=getchar(); }
	return x*f;
}
int main()
{
	lod n;
	scanf("%Lf",&n);
	printf("%.12Lf\n",n/(n*2-1)*(n+1)/2);
	return 0;
}