Codeforces Round #105 (Div. 2) D. Bag of mice
2013-10-20 22:05
585 查看
D. Bag of mice
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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 exceed10 - 9.
Sample test(s)
input
output
input
output
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.
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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 exceed10 - 9.
Sample test(s)
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.
设dp[i][j]表示现在轮到王妃抓时有i只白鼠,j只黑鼠,王妃赢的概率 明显 dp[0][j]=0,0<=j<=b;因为没有白色老鼠了 dp[i][0]=1,1<=i<=w;因为都是白色老鼠,抓一次肯定赢了。 dp[i][j]可以转化成下列四种状态: 1、王妃抓到一只白鼠,则王妃赢了,概率为i/(i+j); 2、王妃抓到一只黑鼠,龙抓到一只黑鼠,跑出来一只黑鼠,则转移到dp[i][j-3]。 概率为j/(i+j)*(j-1)/(i+j-1)*(j-2)/(i+j-2); 3、王妃抓到一只黑鼠,龙抓到一只黑鼠,跑出来一只白鼠,则转移到dp[i-1][j-2]. 概率为j/(i+j)*(j-1)/(i+j-1)*i/(i+j-2);
#include <iostream> #include <stdio.h> #include <string.h> using namespace std; #define M 1005 double dp[M][M]; int main() { int w,b,i,j; while(scanf("%d%d",&w,&b)!=EOF){ for(i=0;i<=b;i++)dp[0][i]=0; for(i=1;i<=w;i++)dp[i][0]=1; for(i=1;i<=w;i++) for(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("%.9f\n",dp[w][b]); } return 0; }
相关文章推荐
- 放几张吴悠校园行
- 总结一下DataSet数据集ds和GridView的所有行遍历的方法
- php程序员应该掌握的10个技能
- 101个MySQL 的调节和优化的提示
- hdu2669 欧几里得水题
- Java SE——多态续、抽象、接口
- 大学专业学习期望与目标
- 个人推荐的Weka教程,包含了数据格式、数据准备、分类和聚类Demo
- Java自带的性能监测工具用法简介——jstack、jconsole、jinfo、jmap、jdb、jsta、jvisualvm
- Linux Shell 返回值总结
- HDU 2458 最大团个数=顶点数 - 补图最大匹配数 二分匹配
- php查询子字符串位置代码
- 开源企业级监控系统-zabbix(一)
- 收藏
- TEST
- LUA应用程序实例
- ios7 tableview被navigationbar挡住
- WIN8外包公司【经验分享】——升级WIN8.1后VS2012报错解决方法
- C++读入两个参数
- 刚子扯谈:专注 极致 口碑 快