Codeforces Round #301 (Div. 2)D (概率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 rs 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


题意:3个物种分别有r,s,p个第一种吃第二种,第二种吃第三种,第三种吃第一种,每隔一段时间两个生物相遇,问经过足够长的时间后每个物种存活(其他物种死亡)的概率。

dp[i][j][k]表示三个物种分别为i,j,k且第一个物种存活下的概率。状态转移为dp[i][j][k] = (i*j*dp[i][j-1][k]+i*k*dp[i-1][j][k]+j*k*dp[i][j][k-1])/(i*j+i*k+j*k).


#include<bits/stdc++.h>
using namespace std;
double dp[101][101][101];
double dfs(int i,int j,int k){
    if(!k) return dp[i][j][k]=1;
    if(!(i&&j)) return dp[i][j][k]=0;
    if(dp[i][j][k]) return dp[i][j][k];
    return dp[i][j][k]=(i*j*dfs(i,j-1,k)+k*i*dfs(i-1,j,k)+j*k*dfs(i,j,k-1))/(i*j+j*k+k*i);
}
int main()
{
    int r,s,p;
    cin>>r>>s>>p;
    printf("%.12f ",dfs(r,s,p));
    memset(dp,0,sizeof dp);
    printf("%.12f ",dfs(s,p,r));
    memset(dp,0,sizeof dp);
    printf("%.12f\n",dfs(p,r,s));
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值