概率论 - Keeping Rabbits - CCPC 2019 哈尔滨

概率论 - Keeping Rabbits - CCPC 2019 哈尔滨

题意：

$给定n个数w_1,w_2,...w_n，每天都会有一个数增加1，$

$第i个数增加1的概率为：$

$$\frac{w_i}{{\sum }_{j=1}^n{w}_j}$$

$求k天后，各个数大小的期望是多少。$

Input

The input contains multiple cases. The first line of the input contains a single integer T (1≤T≤10⁵), the number of cases.

For each case, the first line of the input contains two integers n and k (1≤n≤10⁵,1≤k≤10⁹). The second line contains n integers w1,w2,…,wn (1≤i≤n,1≤wi≤10⁹).

It’s guaranteed that the sum of n over all cases doesn’t exceed 10⁶.

Output

For each case, print a single line containing n space-separated real numbers, where the i-th (1≤i≤n) number should be equal to the expected weight of the i-th rabbit after k days.

Your answer will be considered correct if the absolute or relative error does not exceed 10⁻⁴.

Example
input

3
1 1
2
2 2
1 3
3 2
1 1 1

output

3.00000000
1.50000000 4.50000000
1.66666667 1.66666667 1.66666667

1.5 s, 512 MB

---

分析：

$看到这个数据范围，显然我们是要做到O(nlog)或者O(n)的级别。$

$我们先尝试表示第k天，第i个数的期望值E(w_k(i))：$

$记第k天所有数的和sum(k)={\sum }_{i=1}^n{w}_k(i)，第i个数增1的概率为P_k(i)=\frac{w_{k-1}(i)}{sum(k-1)}，$

$容易发现：$

$$sum(k)=sum(k-1)+1，k\ge 1$$

$则:$

$$\begin{gathered} E(w_k(i))=P_k(i)\times [w_{k-1}(i)+1]+[1-P_k(i)]\times w_{k-1}(i)= \\ {P}_k(i)+w_{k-1}(i)=w_{k-1}(i)\times (1+\frac{1}{sum(k-1)}) \end{gathered}$$

$继续推导：$

$$\begin{gathered} E(w_k(i))=w_{k-1}(i)\times (1+\frac{1}{sum(k-1)})=E(w_{k-1}(i))\times (1+\frac{1}{sum(k-1)})= \\ {w}_{k-2}(i)\times (1+\frac{1}{sum(k-1)})\times (1+\frac{1}{sum(k-2)})=...= \\ {w}_1(i)\times \prod _{i=1}^k(1+\frac{1}{sum(i)}) \end{gathered}$$

$到这里，乍一看，我们需要处理一个前缀积，但是k\le 10^9，因此我们需要发掘其他性质。$

$事实上，因为sum(i)=sum(i-1)+1，所以：$

$$\prod _{i=1}^k(1+\frac{1}{sum(i)})=\prod _{i=1}^k(\frac{sum(i)+1}{sum(i)})=\frac{sum(k)+1}{sum(1)}=\frac{sum(1)+k}{sum(1)}$$

$因此，最终答案：$

$$E(w_k(i))=w_1(i)\times \frac{sum(1)+k}{sum(1)}$$

代码：

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
 
using namespace std;
 
const int N = 1e5+10;
 
int T;
int n, k;
double w[N];
 
int main()
{
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d",&n, &k);
		double sum = 0;
		for(int i=0;i<n;i++) 
		{
			scanf("%lf",&w[i]);
			sum += w[i];
		}
		for(int i=0;i<n;i++) printf("%f ",w[i]*(1+k/sum));
		puts("");
	}
	
	return 0;
}