微信公众号搜"智元新知"关注
微信扫一扫可直接关注哦!

CF# 301 D Bad Luck Island概率dp+记忆化

D. Bad Luck Island
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

The Bad Luck Island is inhabited by three kinds of species: r rocks, s scissors and p papers. At some moments of time two random individuals meet (all pairs of individuals can meet equiprobably),and if they belong to different species,then one individual kills the other one: a rock kills scissors,scissors kill paper,and paper kills a rock. Your task is to determine for each species what is the probability that this species will be the only one to inhabit this island after a long enough period of time.

Input

The single line contains three integers r,sans-serif">s and p (1?≤?r,?s,?p?≤?100) ― the original number of individuals in the species of rock,scissors and paper,respectively.

Output

Print three space-separated real numbers: the probabilities,at which the rocks,the scissors and the paper will be the only surviving species,respectively. The answer will be considered correct if the relative or absolute error of each number doesn't exceed 10?-?9.

Sample test(s)
input
2 2 2
output
0.333333333333 0.333333333333 0.333333333333
input
2 1 2
output
0.150000000000 0.300000000000 0.550000000000
input
1 1 3
output
0.057142857143 0.657142857143 0.285714285714

题意:r吃s,s吃p,p吃r,给出3个数数量,求最后3种分别存活的几率


#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> #include<queue> #include<stack> #include<vector> #include<set> #include<map> #define L(x) (x<<1) #define R(x) (x<<1|1) #define MID(x,y) ((x+y)>>1) #define eps 1e⑻ typedef __int64 ll; #define fre(i,a,b) for(i = a; i <b; i++) #define free(i,b,a) for(i = b; i >= a;i--) #define mem(t,v) memset ((t),v,sizeof(t)) #define ssf(n) scanf(%s,n) #define sf(n) scanf(%d,&n) #define sff(a,b) scanf(%d %d,&a,&b) #define sfff(a,c) scanf(%d %d %d,&b,&c) #define pf printf #define bug pf(Hi ) using namespace std; #define INF 0x3f3f3f3f #define N 105 int r,s,p; double dp[N][N][N]; double dfs(int pre,int Now,int nest) //pre吃NowNownest,nest吃pre,最后pre存活的几率 { if(dp[pre][Now][nest]>=0) return dp[pre][Now][nest]; if(pre==0) return 0; if(nest==0) return pre ? 1:0; double ans=0; if(pre&&Now) ans+=(pre*Now*1.0)/(pre*Now+Now*nest+pre*nest)*dfs(pre,Now⑴,nest); //pre吃Now if(Now&&nest) ans+=(Now*nest*1.0)/(pre*Now+Now*nest+pre*nest)*dfs(pre,Now,nest⑴); //Nownest, if(pre&&nest) ans+=(pre*nest*1.0)/(pre*Now+Now*nest+pre*nest)*dfs(pre⑴,nest); //nest吃pre dp[pre][Now][nest]=ans; return ans; } int main() { int i,j,n; mem(dp,⑴); while(~scanf(%d%d%d,&r,&s,&p)) { printf(%.10lf ,dfs(r,p)); printf(%.10lf ,dfs(s,p,r)); printf(%.10lf ,dfs(p,r,s)); } return 0; }




版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。

相关推荐