CodeForces148D Bag of mice（概率dp）

Bag of mice
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
Input
5 5
Output
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个黑老鼠，取到白老鼠赢，没有白老鼠或取完龙赢，公主先取，龙取一只会吓跑一只，问公主赢的概率

思路

正推，dp[i][j]为在i只白老鼠和j只黑老鼠的情况下公主赢的概率
当前状态下公主获胜的概率为i/(i+j)
每一轮都会减少三只老鼠，公主取一只，龙一只，吓走一只
所以转换到下一个状态有两种情况，公主龙取黑，吓走黑和公主龙取黑吓走白；
即dp[i][j]+=dp[i][j-3]j/(i+j)(j-1)/(i+j-1)*(j-2)/(i+j-2)
和dp[i][j]+=dp[i-1][j-2]j/(i+j)(j-1)/(i+j-1)*i/(i+j-2);

当黑老鼠个数为0，白不为0，公主必赢

代码

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<stack>
#include <queue>
using namespace std;
typedef long long ll;
const int inff=0x3f3f3f3f;
double dp[1001][1001];
int w,b;
int main()
{
    while(cin>>w>>b)
    {
        memset(dp,0, sizeof(dp));
        for(int i=1;i<=w;i++)
            dp[i][0]=1.0;
        for(int i=1;i<=w;i++)
            for(int j=1;j<=b;j++)
            {
                dp[i][j]=1.0*i/(i+j);
                if(j>=3)dp[i][j]+=dp[i][j-3]*j/(i+j)*(j-1)/(i+j-1)*(j-2)/(i+j-2);
                if(j>=2)dp[i][j]+=dp[i-1][j-2]*j/(i+j)*(j-1)/(i+j-1)*i/(i+j-2);
            }
        printf("%.9lf\n",dp[w][b]);
}
    return 0;
}