概率DP——CF 768 D - Jon and Orbs (python)

最新推荐文章于 2024-11-16 19:19:32 发布

贝桑不止学Python

最新推荐文章于 2024-11-16 19:19:32 发布

阅读量248

点赞数 2

分类专栏： DP学习(python)

本文链接：https://blog.csdn.net/weixin_66030644/article/details/126795030

版权

概率动态规划白夜行者球体等待天数状态转移

关键词由CSDN通过智能技术生成

DP学习(python) 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

1.Description

Jon Snow is on the lookout for some orbs required to defeat the white walkers. There are k different types of orbs and he needs at least one of each. One orb spawns daily at the base of a Weirwood tree north of the wall. The probability of this orb being of any kind is equal. As the north of wall is full of dangers, he wants to know the minimum number of days he should wait before sending a ranger to collect the orbs such that the probability of him getting at least one of each kind of orb is at least, where ε < 10 - 7.

To better prepare himself, he wants to know the answer for q different values of $p_{i}$ . Since he is busy designing the battle strategy with Sam, he asks you for your help.

2.Input

First line consists of two space separated integers k, q (1 ≤ k, q ≤ 1000) — number of different kinds of orbs and number of queries respectively.

Each of the next q lines contain a single integer $p_{i}$ (1 ≤ $p_{i}$ ≤ 1000) — i-th query.

3.Output

Output q lines. On i-th of them output single integer — answer for i-th query.

Examples
input

1 1
1

output

input

2 2
1
2

output

2
2

4.Ideas

This is a typical probabilistic dynamic programming problem.Thinking about j-th day, i distinct orbs are produced.The probability of that is donated as $dp_{i,j}$ .

In order to spawn i distinct orbs on j-th day, there are only two cases on (j-1)-th day:

Case-1: i orbs have been produced and new orb hasn’t spawned then the probability of that is $\frac{i}{k} \cdot dp_{i,j-1}$
Case-2: i-1 orbs have been produced and new orb is spawned then the probability of that is $\frac{k-(i+1)}{k} \cdot dp_{i-1,j-1}$

Then the state transition equation is:
$dp_{i,j} = \frac{i}{k} \cdot dp_{i,j-1} + \frac{k-(i+1)}{k} \cdot dp_{i-1,j-1}$

We need to find the minimum j s.t. $dp_{k,j} \geq \frac{p_{i}-\epsilon}{2000}$

where
i for number of distinct orbs Jon has till now.
j for number of day Jon waited.
k for number of different kinds of orbs.

5.Code

k, q = map(lambda x : int(x), input().split())
p_list = [eval(input()) for i in range(q)]
p_list_sort = [y for y in p_list]
p_list_sort.sort()

dp = [[0 for i in range(k+1)]]
dp[0][0] = 1
eps = 1e-7
day_list = [0 for i in range(q)]

i, loc = 0, 0
while True:			# j for number of day Jon waited
	i += 1
	dp.append([0 for m in range(k+1)])
	for j in range(1, k+1):	# i for number of distinct orbs Jon has till now
		"""dp[i][j] for probability of Jon having i distinct orbs in j days"""
		dp[i][j] = j / k * dp[i-1][j] + (k-(j-1)) / k * dp[i-1][j-1]
	for p in range(loc, q):
		if p_list_sort[p] - eps < dp[i][-1] * 2000:
			day_list[p_list.index(p_list_sort[p])] = i
			loc += 1
		else:
			break
	if loc == q:
		break

#for i in dp:
#	print(i)
for i in day_list:
	print(i)