【POJ1322】Chocolate (生成函数)

Description

有$c$种颜色的巧克力, 每种颜色有无限个. 现在每次取出一个巧克力, 其颜色等概率为$1\dots c$中的一种.

问最终有$m$种颜色的巧克力个数为奇数的概率.

$n\le 10^6,c\le 100$

Solution

睿智dp题。

设$f_{i,j}$表示当前取了$i$个、有$j$种颜色是奇数个的概率，直接dp即可，时间复杂度$O(nc)$。

Code

/**************************************
 * Au: Hany01
 * Prob: poj1322
 * Date: Nov, 18th, 2018
 * Email: hany01@foxmail.com
**************************************/

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define Rep(i, j) for (register int i = 0, i##_end_ = j; i < i##_end_; ++ i)
#define For(i, j ,k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define SZ(a) ((int)(a.size()))
#define ALL(a) a.begin(), a.end()
#define PB(a) push_back(a)
#define MP(a, b) make_pair(a, b)
#define X first
#define Y second
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define y1 WoXiHuanNiA 
#ifdef hany01
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }
template<typename T> inline T read() {
    register char c_; register T _, __;
    for (_ = 0, __ = 1, c_ = getchar(); !isdigit(c_); c_ = getchar()) if (c_ == '-')  __ = -1;
    for ( ; isdigit(c_); c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}
//EOT


const int maxn = 105;

double fac[maxn];
inline void Init(int n) {
	fac[0] = 1;
	For(i, 1, n) fac[i] = fac[i - 1] * i;
}
inline double C(int n, int m) { return fac[n] / fac[m] / fac[n - m]; }

inline double fpm(double a, int b) {
	register double ans = 1;
	for ( ; b; b >>= 1, a *= a)
		if (b & 1) ans *= a;
	return ans;
}

double p[maxn], p_[maxn];

int main() {
#ifdef hany01
    File("poj1322");
#endif

	Init(100);

	for (register int n, m, c; scanf("%d", &c) != EOF && c; ) {
		n = read<int>(), m = read<int>();
		if (m > c || m > n || ((n - m) & 1)) { puts("0.000"); continue; }
		if (!n && !m) { puts("1.000"); continue; }
		register double ans = 0;
		Set(p, 0), Set(p_, 0);
		For(i, 0, m) For(j, 0, c - m) {
			int t = c - 2 * i - 2 * j;
			if (t > 0) p[t] += C(m, i) * C(c - m, j) * ((i & 1) ? -1 : 1) / fpm(2, c);
			else p_[-t] += C(m, i) * C(c - m, j) * ((i & 1) ? -1 : 1) / fpm(2, c);
		}
		For(k, 1, c) ans += fpm(1. * k / c, n) * (p[k] + ((n & 1) ? -1 : 1) * p_[k]) * C(c, m);
		printf("%.3f\n", ans);
	}

    return 0;
}

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

---

True-Solution

这题的时间复杂度可以做到$O(c\log )$。
首先要保证$m\le c,m\le n$且$n,m$同奇偶，否则概率为$0$。

由于是排列，考虑指数型生成函数。

对于出现奇数次的巧克力，其指数型生成函数为：

$$f_1(x)=\frac{e^x-e^{-x}}{2}$$

出现偶数次的巧克力的生成函数为：

$$f_2(x)=\frac{e^x+e^{-x}}{2}$$

方案数即为$\left(\genfrac{}{}{0ex}{}{c}{m}\right)\times [x^n](f_1(x{)}^m\times f_2(x{)}^{c-m})\times n!$。

(在$c$中颜色中选择$m$个取奇数次，$n!$是指数型生成函数需要乘的)

这时，时间复杂度的瓶颈在于$n$，考虑怎么把$n$去掉。

我们可以将$f_1(x{)}^m\times f_2(x{)}^{c-m}={\left(\frac{e^x-e^{-x}}{2}\right)}^m\times {\left(\frac{e^x+e^{-x}}{2}\right)}^{c-m}$看作一个关于$e^x$的多项式。$e^{kx}$的系数对第$n$项的贡献是$\frac{k^n}{n!}$，就可以把$n!$消掉了！

用FFT计算系数做到$c\log$（上面的代码是$O(c^2)$计算的）。