链接:戳这里
D. Bag of mice
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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只黑鼠的概率,公主赢得概率。
dp[i][j]=i/(i+j);
dp[i][j]=max(dp[i][j],y/(x+y) * (y-1)/(x+y-1) * (y-2)/(x+y-2) *dp[i][j-3]) ;
如果当前公主拿的是黑鼠且龙拿的也是黑鼠逃走的还是黑鼠,那么只需要在剩下i只白鼠j-3只黑鼠继承过来就可以
dp[i][j]=max(dp[i][j],y/(x+y) * (y-1)/(x+y-1) * (x)/(x+y-2) * dp[i-1][i-2]);
如果当前公主拿的是黑鼠且龙拿的也是黑鼠逃走的还是白鼠,那么只需要在剩下i-1只白鼠j-2只黑鼠继承过来就可以
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<iomanip>
#include<cmath>
#include<bitset>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
///#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
#define INF (1ll<<60)-1
#define Max 1e9
using namespace std;
int n,m;
double dp[1010][1010]; /// 当前还剩下i只w和j只b的概率
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) dp[i][0]=1.0;
for(int j=0;j<=m;j++) dp[0][j]=0.0;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
double x=i*1.0;
double y=j*1.0;
dp[i][j]+=(x)/(x+y);
if(j>=3)
dp[i][j]+=((y/(x+y))*((y-1)/(x+y-1))*((y-2)/(x+y-2)))*dp[i][j-3];
if(j>=2)
dp[i][j]+=((y/(x+y))*((y-1)/(x+y-1))*((x/(x+y-2))))*dp[i-1][j-2];
}
}
printf("%.9f\n",dp[n][m]);
return 0;
}