Codeforces 148D. Bag of mice(概率dp)

Codeforces 148D. Bag of mice(概率dp)

Description
The dragon and the princess are arguing about what to do on the New Year’s Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the princess thinks they should just go to bed early. They are desperate to come to an amicable agreement, so they decide to leave this up to chance.

They take turns drawing a mouse from a bag which initially contains w white and b black mice. The person who is the first to draw a white mouse wins. After each mouse drawn by the dragon the rest of mice in the bag panic, and one of them jumps out of the bag itself (the princess draws her mice carefully and doesn’t scare other mice). Princess draws first. What is the probability of the princess winning?

If there are no more mice in the bag and nobody has drawn a white mouse, the dragon wins. Mice which jump out of the bag themselves are not considered to be drawn (do not define the winner). Once a mouse has left the bag, it never returns to it. Every mouse is drawn from the bag with the same probability as every other one, and every mouse jumps out of the bag with the same probability as every other one.

Input
The only line of input data contains two integers w and b (0 ≤ w, b ≤ 1000).

Output
Output the probability of the princess winning. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 9.

Examples
Input

1 3

Output

0.500000000

Input2

5 5

Output2

0.658730159

Note
Let’s go through the first sample. The probability of the princess drawing a white mouse on her first turn and winning right away is 1/4. The probability of the dragon drawing a black mouse and not winning on his first turn is 3/4 * 2/3 = 1/2. After this there are two mice left in the bag — one black and one white; one of them jumps out, and the other is drawn by the princess on her second turn. If the princess’ mouse is white, she wins (probability is 1/2 * 1/2 = 1/4), otherwise nobody gets the white mouse, so according to the rule the dragon wins.

题目大意：
有w只白鼠和b只黑鼠，龙和王妃轮流从袋子里抓鼠，每次抓一只，抓到第一只白鼠的人获胜。当龙抓一只鼠时，袋子里会跑掉一只鼠，跑掉的鼠是等概率的。问王妃获胜的概率。

思路：
设有i只白鼠j只黑鼠的状态下王妃获胜的概率是dp[i][j]，这种状态可由一下三种状态得到：

1. 王妃第一次就取得一只白鼠获胜，概率为i/(i+j)；
2. 王妃没有取到白鼠，取黑鼠的概率是j/(i+j)，若王妃要赢，下次龙一定取黑鼠，概率为(j-1)/(i+j-1)，同时跑掉的是黑鼠，概率为(j-2)/(i+j-2)，状态转移到dp[i][j-3];
3. 王妃没有取到白鼠，取黑鼠的概率是j/(i+j)，若王妃要赢，下次龙一定取黑鼠，概率为(j-1)/(i+j-1)，同时跑掉的是白鼠，概率为i/(i+j-2)，状态转移到dp[i-1][j-2];

综上，dp[i][j] = i/(i+j) + j/(i+j)*(j-1)/(i+j-1)*(j-2)/(i+j-2)*dp[i][j-3] + j/(i+j)*(j-1)/(i+j-1)*i/(i+j-2)*dp[i-1][j-2]。

code:

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

double dp[1005][1005];
int main(){
	int i,j,w,b;
	while(cin>>w>>b){
		for(i=0;i<=w;i++){
			dp[i][0]=1;
		}
		for(j=0;j<=b;j++){
			dp[0][j]=0;
		}
		for(i=1;i<=w;i++){
			for(j=1;j<=b;j++){
				dp[i][j] = i*1.0/(i+j)*1.0;
				if(j>=2){
					dp[i][j] = dp[i][j] + j*1.0/(i+j)*1.0 * (j-1)*1.0/(i+j-1)*1.0 * i*1.0/(i+j-2)*1.0*dp[i-1][j-2];
					//dp[i][j] += j*1.0/(i+j) * (j-1)*1.0/(i+j-1) * (i*1.0)/(i+j-2) * dp[i-1][j-2];
				}
				if(j>=3){
					dp[i][j] = dp[i][j] + j*1.0/(i+j)*1.0 * (j-1)*1.0/(i+j-1)*1.0 * (j-2)*1.0/(i+j-2)*1.0*dp[i][j-3];
					//dp[i][j] += j*1.0/(i+j) * (j-1)*1.0/(i+j-1) * (j-2)*1.0/(i+j-2) * dp[i][j-3];
				}
			}
		}
		double ans = dp[w][b];
		printf("%.9lf\n",ans);
	}
	return 0;
}